Base | Representation |
---|---|
bin | 1010111011001001001101… |
… | …1000000111100110010111 |
3 | 1120112021000020222121120102 |
4 | 2232302103120013212113 |
5 | 3033242414442223301 |
6 | 41313511501124315 |
7 | 2346531522041546 |
oct | 256622330074627 |
9 | 46467006877512 |
10 | 12011201132951 |
11 | 3910a159a9879 |
12 | 141ba26b5969b |
13 | 6918611aa0c7 |
14 | 2d74b948815d |
15 | 15c68b48eb6b |
hex | aec93607997 |
12011201132951 has 2 divisors, whose sum is σ = 12011201132952. Its totient is φ = 12011201132950.
The previous prime is 12011201132941. The next prime is 12011201132981. The reversal of 12011201132951 is 15923110211021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12011201132951 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011201132941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005600566475 + 6005600566476.
It is an arithmetic number, because the mean of its divisors is an integer number (6005600566476).
Almost surely, 212011201132951 is an apocalyptic number.
12011201132951 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011201132951 is an equidigital number, since it uses as much as digits as its factorization.
12011201132951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 29.
Adding to 12011201132951 its reverse (15923110211021), we get a palindrome (27934311343972).
The spelling of 12011201132951 in words is "twelve trillion, eleven billion, two hundred one million, one hundred thirty-two thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •