Base | Representation |
---|---|
bin | 1101101001011010010110… |
… | …10011111010110111111101 |
3 | 10221020221120102210222002001 |
4 | 12310231023103322313331 |
5 | 12413141342200311422 |
6 | 143454255012502301 |
7 | 6215110506140326 |
oct | 664551323726775 |
9 | 127227512728061 |
10 | 30010200010237 |
11 | 96202885a5787 |
12 | 344821731a991 |
13 | 1398c466b8575 |
14 | 75a703cd544d |
15 | 37097a4e4227 |
hex | 1b4b4b4fadfd |
30010200010237 has 2 divisors, whose sum is σ = 30010200010238. Its totient is φ = 30010200010236.
The previous prime is 30010200010207. The next prime is 30010200010253. The reversal of 30010200010237 is 73201000201003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29917771241796 + 92428768441 = 5469714^2 + 304021^2 .
It is a cyclic number.
It is not a de Polignac number, because 30010200010237 - 235 = 29975840271869 is a prime.
It is a super-2 number, since 2×300102000102372 (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 (30010200010207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15005100005118 + 15005100005119.
It is an arithmetic number, because the mean of its divisors is an integer number (15005100005119).
Almost surely, 230010200010237 is an apocalyptic number.
It is an amenable number.
30010200010237 is a deficient number, since it is larger than the sum of its proper divisors (1).
30010200010237 is an equidigital number, since it uses as much as digits as its factorization.
30010200010237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 19.
The spelling of 30010200010237 in words is "thirty trillion, ten billion, two hundred million, ten thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •