Base | Representation |
---|---|

bin | 1010111010100011111101… |

… | …0100101110010000111011 |

3 | 1120111022012100000100021011 |

4 | 2232220333110232100323 |

5 | 3033111424430201021 |

6 | 41305135312054351 |

7 | 2346025643355265 |

oct | 256507724562073 |

9 | 46438170010234 |

10 | 12001201022011 |

11 | 3907754119483 |

12 | 1419ab5b343b7 |

13 | 6909294812b6 |

14 | 2d6c0b2d6b35 |

15 | 15c2a35adde1 |

hex | aea3f52e43b |

12001201022011 has 4 divisors (see below), whose sum is σ = 12032535750912. Its totient is φ = 11969866293112.

The previous prime is 12001201021897. The next prime is 12001201022033. The reversal of 12001201022011 is 11022010210021.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 12001201022011 - 2^{13} = 12001201013819 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 12001201021982 and 12001201022000.

It is not an unprimeable number, because it can be changed into a prime (12001201022411) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15667363876 + ... + 15667364641.

It is an arithmetic number, because the mean of its divisors is an integer number (3008133937728).

Almost surely, 2^{12001201022011} is an apocalyptic number.

12001201022011 is a deficient number, since it is larger than the sum of its proper divisors (31334728901).

12001201022011 is an equidigital number, since it uses as much as digits as its factorization.

12001201022011 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 31334728900.

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 12001201022011 its reverse (11022010210021), we get a palindrome (23023211232032).

The spelling of 12001201022011 in words is "twelve trillion, one billion, two hundred one million, twenty-two thousand, eleven".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •