Base | Representation |
---|---|
bin | 1101111010110010011000… |
… | …10001001001111111111001 |
3 | 11000101000120112200212101221 |
4 | 12331121030101021333321 |
5 | 13002432034412021423 |
6 | 145032432224312041 |
7 | 6306204233542555 |
oct | 675311421117771 |
9 | 130330515625357 |
10 | 30607216517113 |
11 | 98304a1882785 |
12 | 3523a72a72621 |
13 | 141032c1c0a12 |
14 | 77b57bc2c865 |
15 | 38126d47de5d |
hex | 1bd64c449ff9 |
30607216517113 has 2 divisors, whose sum is σ = 30607216517114. Its totient is φ = 30607216517112.
The previous prime is 30607216516951. The next prime is 30607216517149. The reversal of 30607216517113 is 31171561270603.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27134222738704 + 3472993778409 = 5209052^2 + 1863597^2 .
It is a cyclic number.
It is not a de Polignac number, because 30607216517113 - 221 = 30607214419961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30607216517113.
It is not a weakly prime, because it can be changed into another prime (30607216517183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15303608258556 + 15303608258557.
It is an arithmetic number, because the mean of its divisors is an integer number (15303608258557).
Almost surely, 230607216517113 is an apocalyptic number.
It is an amenable number.
30607216517113 is a deficient number, since it is larger than the sum of its proper divisors (1).
30607216517113 is an equidigital number, since it uses as much as digits as its factorization.
30607216517113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 158760, while the sum is 43.
Adding to 30607216517113 its reverse (31171561270603), we get a palindrome (61778777787716).
The spelling of 30607216517113 in words is "thirty trillion, six hundred seven billion, two hundred sixteen million, five hundred seventeen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •