Base | Representation |
---|---|
bin | 110111111011010010… |
… | …1110000101110010111 |
3 | 102111000001121122221011 |
4 | 1233312211300232113 |
5 | 3431431402223111 |
6 | 131101305433051 |
7 | 11451135310204 |
oct | 1576645605627 |
9 | 374001548834 |
10 | 120101211031 |
11 | 46a310034aa |
12 | 1b33979b787 |
13 | b430163159 |
14 | 5b54970cab |
15 | 31cdce9021 |
hex | 1bf6970b97 |
120101211031 has 2 divisors, whose sum is σ = 120101211032. Its totient is φ = 120101211030.
The previous prime is 120101211007. The next prime is 120101211077. The reversal of 120101211031 is 130112101021.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120101211031 - 231 = 117953727383 is a prime.
It is a super-2 number, since 2×1201012110312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120101211731) 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, 60050605515 + 60050605516.
It is an arithmetic number, because the mean of its divisors is an integer number (60050605516).
Almost surely, 2120101211031 is an apocalyptic number.
120101211031 is a deficient number, since it is larger than the sum of its proper divisors (1).
120101211031 is an equidigital number, since it uses as much as digits as its factorization.
120101211031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 120101211031 its reverse (130112101021), we get a palindrome (250213312052).
The spelling of 120101211031 in words is "one hundred twenty billion, one hundred one million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •