Base | Representation |
---|---|
bin | 10001101000110010000… |
… | …001110011001011001111 |
3 | 11021212102202122222002212 |
4 | 101220302001303023033 |
5 | 124324204122010111 |
6 | 2324443325141035 |
7 | 153364662644423 |
oct | 21506201631317 |
9 | 4255382588085 |
10 | 1212020110031 |
11 | 428018833725 |
12 | 176a930ba77b |
13 | 8a3a6970a53 |
14 | 4293aa9cb83 |
15 | 217da0ce98b |
hex | 11a320732cf |
1212020110031 has 2 divisors, whose sum is σ = 1212020110032. Its totient is φ = 1212020110030.
The previous prime is 1212020109961. The next prime is 1212020110139. The reversal of 1212020110031 is 1300110202121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1212020110031 - 218 = 1212019847887 is a prime.
It is a super-2 number, since 2×12120201100312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212020109988 and 1212020110015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212020112031) 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, 606010055015 + 606010055016.
It is an arithmetic number, because the mean of its divisors is an integer number (606010055016).
Almost surely, 21212020110031 is an apocalyptic number.
1212020110031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212020110031 is an equidigital number, since it uses as much as digits as its factorization.
1212020110031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1212020110031 its reverse (1300110202121), we get a palindrome (2512130312152).
The spelling of 1212020110031 in words is "one trillion, two hundred twelve billion, twenty million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •