Base | Representation |
---|---|
bin | 1101101111010000100101… |
… | …00010100001111111110101 |
3 | 10221222011011021021211110212 |
4 | 12313220102202201333311 |
5 | 12424434323404031401 |
6 | 144130443124355205 |
7 | 6235452331323311 |
oct | 667502242417765 |
9 | 127864137254425 |
10 | 30211111002101 |
11 | 9698507616617 |
12 | 347b147b45b05 |
13 | 13b1b8467c283 |
14 | 766322d94b41 |
15 | 375cd8916dbb |
hex | 1b7a128a1ff5 |
30211111002101 has 2 divisors, whose sum is σ = 30211111002102. Its totient is φ = 30211111002100.
The previous prime is 30211111002097. The next prime is 30211111002167. The reversal of 30211111002101 is 10120011111203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29924510308900 + 286600693201 = 5470330^2 + 535351^2 .
It is a cyclic number.
It is not a de Polignac number, because 30211111002101 - 22 = 30211111002097 is a prime.
It is a super-2 number, since 2×302111110021012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30211111002001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105555501050 + 15105555501051.
It is an arithmetic number, because the mean of its divisors is an integer number (15105555501051).
Almost surely, 230211111002101 is an apocalyptic number.
It is an amenable number.
30211111002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211111002101 is an equidigital number, since it uses as much as digits as its factorization.
30211111002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 30211111002101 its reverse (10120011111203), we get a palindrome (40331122113304).
The spelling of 30211111002101 in words is "thirty trillion, two hundred eleven billion, one hundred eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •