Base | Representation |
---|---|
bin | 1101101111010000100100… |
… | …00001010111111010000101 |
3 | 10221222011010122221020011222 |
4 | 12313220102001113322011 |
5 | 12424434314142410041 |
6 | 144130442214210125 |
7 | 6235452164412053 |
oct | 667502201277205 |
9 | 127864118836158 |
10 | 30211102310021 |
11 | 969850271a086 |
12 | 347b145053945 |
13 | 13b1b82927b29 |
14 | 766321b711d3 |
15 | 375cd7c9b74b |
hex | 1b7a12057e85 |
30211102310021 has 2 divisors, whose sum is σ = 30211102310022. Its totient is φ = 30211102310020.
The previous prime is 30211102309919. The next prime is 30211102310063. The reversal of 30211102310021 is 12001320111203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30115674450625 + 95427859396 = 5487775^2 + 308914^2 .
It is an emirp because it is prime and its reverse (12001320111203) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30211102310021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30211102340021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105551155010 + 15105551155011.
It is an arithmetic number, because the mean of its divisors is an integer number (15105551155011).
Almost surely, 230211102310021 is an apocalyptic number.
It is an amenable number.
30211102310021 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211102310021 is an equidigital number, since it uses as much as digits as its factorization.
30211102310021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30211102310021 its reverse (12001320111203), we get a palindrome (42212422421224).
The spelling of 30211102310021 in words is "thirty trillion, two hundred eleven billion, one hundred two million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •