Base | Representation |
---|---|
bin | 100100100001001000000011… |
… | …0111010000111000111001111 |
3 | 1120010022120122121220120111211 |
4 | 1021002100012322013013033 |
5 | 314100214420241430111 |
6 | 3055054452043355251 |
7 | 124441545010666042 |
oct | 11102200672070717 |
9 | 1503276577816454 |
10 | 321212130030031 |
11 | 93391332467759 |
12 | 30039090522b27 |
13 | 10a302350643c6 |
14 | 5946a701a6c59 |
15 | 27206e8288521 |
hex | 1242406e871cf |
321212130030031 has 2 divisors, whose sum is σ = 321212130030032. Its totient is φ = 321212130030030.
The previous prime is 321212130029971. The next prime is 321212130030037. The reversal of 321212130030031 is 130030031212123.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 321212130030031 - 221 = 321212127932879 is a prime.
It is a super-2 number, since 2×3212121300300312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 321212130029984 and 321212130030011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321212130030037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160606065015015 + 160606065015016.
It is an arithmetic number, because the mean of its divisors is an integer number (160606065015016).
Almost surely, 2321212130030031 is an apocalyptic number.
321212130030031 is a deficient number, since it is larger than the sum of its proper divisors (1).
321212130030031 is an equidigital number, since it uses as much as digits as its factorization.
321212130030031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 321212130030031 its reverse (130030031212123), we get a palindrome (451242161242154).
The spelling of 321212130030031 in words is "three hundred twenty-one trillion, two hundred twelve billion, one hundred thirty million, thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •