Base | Representation |
---|---|
bin | 110111111011010110… |
… | …1011000110011100011 |
3 | 102111000012101020021212 |
4 | 1233312231120303203 |
5 | 3431432410211321 |
6 | 131101420340335 |
7 | 11451161304545 |
oct | 1576655306343 |
9 | 374005336255 |
10 | 120103210211 |
11 | 46a32149516 |
12 | 1b33a3a46ab |
13 | b4306b30ba |
14 | 5b54d31695 |
15 | 31ce09155b |
hex | 1bf6b58ce3 |
120103210211 has 2 divisors, whose sum is σ = 120103210212. Its totient is φ = 120103210210.
The previous prime is 120103210181. The next prime is 120103210237. The reversal of 120103210211 is 112012301021.
It is a strong prime.
It is an emirp because it is prime and its reverse (112012301021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 120103210211 - 226 = 120036101347 is a prime.
It is a super-2 number, since 2×1201032102112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120103213211) 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, 60051605105 + 60051605106.
It is an arithmetic number, because the mean of its divisors is an integer number (60051605106).
Almost surely, 2120103210211 is an apocalyptic number.
120103210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
120103210211 is an equidigital number, since it uses as much as digits as its factorization.
120103210211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 120103210211 its reverse (112012301021), we get a palindrome (232115511232).
The spelling of 120103210211 in words is "one hundred twenty billion, one hundred three million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •