Base | Representation |
---|---|
bin | 1010111010100110111110… |
… | …0111101100010011111001 |
3 | 1120111101021210200210020021 |
4 | 2232221233213230103321 |
5 | 3033120104343113423 |
6 | 41305351535130441 |
7 | 2346055012543111 |
oct | 256515747542371 |
9 | 46441253623207 |
10 | 12002011301113 |
11 | 390802a540129 |
12 | 141a0a1373a21 |
13 | 690a282c2aa2 |
14 | 2d6c86b7a041 |
15 | 15c2ee7b695d |
hex | aea6f9ec4f9 |
12002011301113 has 2 divisors, whose sum is σ = 12002011301114. Its totient is φ = 12002011301112.
The previous prime is 12002011301089. The next prime is 12002011301129. The reversal of 12002011301113 is 31110311020021.
It is a happy number.
It is an a-pointer prime, because the next prime (12002011301129) can be obtained adding 12002011301113 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11267488597264 + 734522703849 = 3356708^2 + 857043^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12002011301113 is a prime.
It is not a weakly prime, because it can be changed into another prime (12002011301513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6001005650556 + 6001005650557.
It is an arithmetic number, because the mean of its divisors is an integer number (6001005650557).
Almost surely, 212002011301113 is an apocalyptic number.
It is an amenable number.
12002011301113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12002011301113 is an equidigital number, since it uses as much as digits as its factorization.
12002011301113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12002011301113 its reverse (31110311020021), we get a palindrome (43112322321134).
The spelling of 12002011301113 in words is "twelve trillion, two billion, eleven million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •