Base | Representation |
---|---|
bin | 11011010011101101111010… |
… | …010010101010110001110011 |
3 | 120202020122211100220110021010 |
4 | 123103231322102222301303 |
5 | 111220223322341242321 |
6 | 1103234111005402003 |
7 | 34204046012513361 |
oct | 3323557222526163 |
9 | 522218740813233 |
10 | 120102222212211 |
11 | 352a5080420228 |
12 | 11578747269303 |
13 | 520278b447085 |
14 | 2192d9b2b0631 |
15 | dd42039e8676 |
hex | 6d3b7a4aac73 |
120102222212211 has 8 divisors (see below), whose sum is σ = 167098743947520. Its totient is φ = 76586924309192.
The previous prime is 120102222212183. The next prime is 120102222212213. The reversal of 120102222212211 is 112212222201021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120102222212211 - 210 = 120102222211187 is a prime.
It is a super-2 number, since 2×1201022222122112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120102222212213) 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, 870305957991 + ... + 870305958128.
It is an arithmetic number, because the mean of its divisors is an integer number (20887342993440).
Almost surely, 2120102222212211 is an apocalyptic number.
120102222212211 is a deficient number, since it is larger than the sum of its proper divisors (46996521735309).
120102222212211 is a wasteful number, since it uses less digits than its factorization.
120102222212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1740611916145.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 120102222212211 its reverse (112212222201021), we get a palindrome (232314444413232).
The spelling of 120102222212211 in words is "one hundred twenty trillion, one hundred two billion, two hundred twenty-two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •