Base | Representation |
---|---|
bin | 11011010101011101100100… |
… | …111000011111010000011111 |
3 | 120202200010022101201110010111 |
4 | 123111131210320133100133 |
5 | 111224204401230041111 |
6 | 1103405140324350451 |
7 | 34215522155035462 |
oct | 3325354470372037 |
9 | 522603271643114 |
10 | 120222122112031 |
11 | 35340a08825625 |
12 | 11597a29545427 |
13 | 5210b88984164 |
14 | 2198ad31db2d9 |
15 | dd73becc9a21 |
hex | 6d5764e1f41f |
120222122112031 has 2 divisors, whose sum is σ = 120222122112032. Its totient is φ = 120222122112030.
The previous prime is 120222122112011. The next prime is 120222122112091. The reversal of 120222122112031 is 130211221222021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 120222122112031 - 29 = 120222122111519 is a prime.
It is a super-2 number, since 2×1202221221120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120222122111993 and 120222122112011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120222122112011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60111061056015 + 60111061056016.
It is an arithmetic number, because the mean of its divisors is an integer number (60111061056016).
Almost surely, 2120222122112031 is an apocalyptic number.
120222122112031 is a deficient number, since it is larger than the sum of its proper divisors (1).
120222122112031 is an equidigital number, since it uses as much as digits as its factorization.
120222122112031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 120222122112031 its reverse (130211221222021), we get a palindrome (250433343334052).
The spelling of 120222122112031 in words is "one hundred twenty trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •