Base | Representation |
---|---|
bin | 11011110000110010101011… |
… | …101001010000111101110101 |
3 | 121000022122222120102221111020 |
4 | 123300302223221100331311 |
5 | 112000442212230341041 |
6 | 1111404021230131353 |
7 | 34501310012554533 |
oct | 3360625351207565 |
9 | 530278876387436 |
10 | 122100210012021 |
11 | 359a545445124a |
12 | 1183ba09350b59 |
13 | 5319000b51c37 |
14 | 222197880b153 |
15 | e1b190003866 |
hex | 6f0caba50f75 |
122100210012021 has 8 divisors (see below), whose sum is σ = 162802551797184. Its totient is φ = 81399004117440.
The previous prime is 122100210011987. The next prime is 122100210012023. The reversal of 122100210012021 is 120210012001221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122100210012021 - 229 = 122099673141109 is a prime.
It is a super-2 number, since 2×1221002100120212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122100210012023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 283721796 + ... + 284151821.
It is an arithmetic number, because the mean of its divisors is an integer number (20350318974648).
Almost surely, 2122100210012021 is an apocalyptic number.
It is an amenable number.
122100210012021 is a deficient number, since it is larger than the sum of its proper divisors (40702341785163).
122100210012021 is an equidigital number, since it uses as much as digits as its factorization.
122100210012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567945291.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122100210012021 its reverse (120210012001221), we get a palindrome (242310222013242).
The spelling of 122100210012021 in words is "one hundred twenty-two trillion, one hundred billion, two hundred ten million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •