Base | Representation |
---|---|
bin | 1010111010100110111111… |
… | …0011100000111001101111 |
3 | 1120111101022000112020020222 |
4 | 2232221233303200321233 |
5 | 3033120111141300421 |
6 | 41305352125401555 |
7 | 2346055051101101 |
oct | 256515763407157 |
9 | 46441260466228 |
10 | 12002014400111 |
11 | 390803126748a |
12 | 141a0a24092bb |
13 | 690a28b39508 |
14 | 2d6c87345571 |
15 | 15c2eebc9cab |
hex | aea6fce0e6f |
12002014400111 has 8 divisors (see below), whose sum is σ = 12259082246400. Its totient is φ = 11745017630488.
The previous prime is 12002014400029. The next prime is 12002014400137. The reversal of 12002014400111 is 11100441020021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12002014400111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12002014400111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12002014400711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17427761 + ... + 18103338.
It is an arithmetic number, because the mean of its divisors is an integer number (1532385280800).
Almost surely, 212002014400111 is an apocalyptic number.
12002014400111 is a deficient number, since it is larger than the sum of its proper divisors (257067846289).
12002014400111 is an equidigital number, since it uses as much as digits as its factorization.
12002014400111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35538333.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12002014400111 its reverse (11100441020021), we get a palindrome (23102455420132).
The spelling of 12002014400111 in words is "twelve trillion, two billion, fourteen million, four hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •