Base | Representation |
---|---|
bin | 11011010101010010011110… |
… | …011000111010011011101011 |
3 | 120202121222112122221121001212 |
4 | 123111102132120322123223 |
5 | 111224010443203330441 |
6 | 1103355445431303335 |
7 | 34214620603615433 |
oct | 3325223630723353 |
9 | 522558478847055 |
10 | 120210202011371 |
11 | 3533695118656a |
12 | 1159566151ab4b |
13 | 520ca09245c64 |
14 | 21982c205b2c3 |
15 | dd6e2358ceeb |
hex | 6d549e63a6eb |
120210202011371 has 2 divisors, whose sum is σ = 120210202011372. Its totient is φ = 120210202011370.
The previous prime is 120210202011337. The next prime is 120210202011373. The reversal of 120210202011371 is 173110202012021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120210202011371 - 222 = 120210197817067 is a prime.
It is a super-2 number, since 2×1202102020113712 (a number of 29 digits) contains 22 as substring.
Together with 120210202011373, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120210202011373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60105101005685 + 60105101005686.
It is an arithmetic number, because the mean of its divisors is an integer number (60105101005686).
Almost surely, 2120210202011371 is an apocalyptic number.
120210202011371 is a deficient number, since it is larger than the sum of its proper divisors (1).
120210202011371 is an equidigital number, since it uses as much as digits as its factorization.
120210202011371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 120210202011371 its reverse (173110202012021), we get a palindrome (293320404023392).
The spelling of 120210202011371 in words is "one hundred twenty trillion, two hundred ten billion, two hundred two million, eleven thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •