Base | Representation |
---|---|
bin | 10001101000110010000… |
… | …101101001110000011111 |
3 | 11021212102211120021120021 |
4 | 101220302011221300133 |
5 | 124324204401320111 |
6 | 2324443402533011 |
7 | 153365004352141 |
oct | 21506205516037 |
9 | 4255384507507 |
10 | 1212021120031 |
11 | 428019363537 |
12 | 176a93507167 |
13 | 8a3a6c35697 |
14 | 4293ac82c91 |
15 | 217da22dd71 |
hex | 11a32169c1f |
1212021120031 has 2 divisors, whose sum is σ = 1212021120032. Its totient is φ = 1212021120030.
The previous prime is 1212021119989. The next prime is 1212021120049. The reversal of 1212021120031 is 1300211202121.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212021120031 is a prime.
It is a super-2 number, since 2×12120211200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212021119987 and 1212021120014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212021120931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606010560015 + 606010560016.
It is an arithmetic number, because the mean of its divisors is an integer number (606010560016).
Almost surely, 21212021120031 is an apocalyptic number.
1212021120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212021120031 is an equidigital number, since it uses as much as digits as its factorization.
1212021120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1212021120031 its reverse (1300211202121), we get a palindrome (2512232322152).
The spelling of 1212021120031 in words is "one trillion, two hundred twelve billion, twenty-one million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •