Base | Representation |
---|---|
bin | 1101101001000111100100… |
… | …00101111101100001000101 |
3 | 10221012222112110210011100211 |
4 | 12310203302011331201011 |
5 | 12413010212442303404 |
6 | 143445510050235421 |
7 | 6214302526062262 |
oct | 664436205754105 |
9 | 127188473704324 |
10 | 30000113244229 |
11 | 9616a81909127 |
12 | 3446281285b71 |
13 | 1397cc9a3c17b |
14 | 75a028428269 |
15 | 370589be7b04 |
hex | 1b48f217d845 |
30000113244229 has 2 divisors, whose sum is σ = 30000113244230. Its totient is φ = 30000113244228.
The previous prime is 30000113244173. The next prime is 30000113244251. The reversal of 30000113244229 is 92244231100003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20929957055329 + 9070156188900 = 4574927^2 + 3011670^2 .
It is an emirp because it is prime and its reverse (92244231100003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30000113244229 - 221 = 30000111147077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30000113244229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30000113244529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15000056622114 + 15000056622115.
It is an arithmetic number, because the mean of its divisors is an integer number (15000056622115).
Almost surely, 230000113244229 is an apocalyptic number.
It is an amenable number.
30000113244229 is a deficient number, since it is larger than the sum of its proper divisors (1).
30000113244229 is an equidigital number, since it uses as much as digits as its factorization.
30000113244229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 30000113244229 in words is "thirty trillion, one hundred thirteen million, two hundred forty-four thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •