Base | Representation |
---|---|
bin | 11100100000100010… |
… | …100100101000001011 |
3 | 2221000022102221000101 |
4 | 130200202210220023 |
5 | 1000142320024112 |
6 | 22021245350231 |
7 | 2132363461426 |
oct | 344042445013 |
9 | 87008387011 |
10 | 30610704907 |
11 | 11a88a43732 |
12 | 5b23568377 |
13 | 2b6aa6b353 |
14 | 16a55ba9bd |
15 | be255d757 |
hex | 7208a4a0b |
30610704907 has 2 divisors, whose sum is σ = 30610704908. Its totient is φ = 30610704906.
The previous prime is 30610704799. The next prime is 30610704911. The reversal of 30610704907 is 70940701603.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30610704907 - 215 = 30610672139 is a prime.
It is not a weakly prime, because it can be changed into another prime (30610704947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15305352453 + 15305352454.
It is an arithmetic number, because the mean of its divisors is an integer number (15305352454).
Almost surely, 230610704907 is an apocalyptic number.
30610704907 is a deficient number, since it is larger than the sum of its proper divisors (1).
30610704907 is an equidigital number, since it uses as much as digits as its factorization.
30610704907 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31752, while the sum is 37.
The spelling of 30610704907 in words is "thirty billion, six hundred ten million, seven hundred four thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •