Base | Representation |
---|---|
bin | 11011010010011010001011… |
… | …001010101110110110101011 |
3 | 120201221001202022011012220101 |
4 | 123102122023022232312223 |
5 | 111212240203110444321 |
6 | 1103124521121010231 |
7 | 34164413642213344 |
oct | 3322321312566653 |
9 | 521831668135811 |
10 | 120012311031211 |
11 | 3526aa31954175 |
12 | 11563234183977 |
13 | 51c715cb52321 |
14 | 218c8ac0d30cb |
15 | dd1be0363791 |
hex | 6d268b2aedab |
120012311031211 has 2 divisors, whose sum is σ = 120012311031212. Its totient is φ = 120012311031210.
The previous prime is 120012311031187. The next prime is 120012311031233. The reversal of 120012311031211 is 112130113210021.
It is a strong prime.
It is an emirp because it is prime and its reverse (112130113210021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120012311031211 - 213 = 120012311023019 is a prime.
It is a super-3 number, since 3×1200123110312113 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (120012311001211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60006155515605 + 60006155515606.
It is an arithmetic number, because the mean of its divisors is an integer number (60006155515606).
Almost surely, 2120012311031211 is an apocalyptic number.
120012311031211 is a deficient number, since it is larger than the sum of its proper divisors (1).
120012311031211 is an equidigital number, since it uses as much as digits as its factorization.
120012311031211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 120012311031211 its reverse (112130113210021), we get a palindrome (232142424241232).
The spelling of 120012311031211 in words is "one hundred twenty trillion, twelve billion, three hundred eleven million, thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •