Base | Representation |
---|---|
bin | 111010011000… |
… | …0001110010101 |
3 | 2010120221212001 |
4 | 1310300032111 |
5 | 30313344404 |
6 | 3011555301 |
7 | 521101663 |
oct | 164601625 |
9 | 63527761 |
10 | 30606229 |
11 | 16304a05 |
12 | a2bbb31 |
13 | 6457bc4 |
14 | 40c9c33 |
15 | 2a487a4 |
hex | 1d30395 |
30606229 has 2 divisors, whose sum is σ = 30606230. Its totient is φ = 30606228.
The previous prime is 30606227. The next prime is 30606263. The reversal of 30606229 is 92260603.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30228004 + 378225 = 5498^2 + 615^2 .
It is an emirp because it is prime and its reverse (92260603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30606229 - 21 = 30606227 is a prime.
Together with 30606227, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p1893133 and since 30606229 and 1893133 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 30606197 and 30606206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30606227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15303114 + 15303115.
It is an arithmetic number, because the mean of its divisors is an integer number (15303115).
Almost surely, 230606229 is an apocalyptic number.
It is an amenable number.
30606229 is a deficient number, since it is larger than the sum of its proper divisors (1).
30606229 is an equidigital number, since it uses as much as digits as its factorization.
30606229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 30606229 is about 5532.2896706517. The cubic root of 30606229 is about 312.8023024547.
The spelling of 30606229 in words is "thirty million, six hundred six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •