Base | Representation |
---|---|
bin | 111010011000… |
… | …0010001011001 |
3 | 2010120222010022 |
4 | 1310300101121 |
5 | 30313401200 |
6 | 3012000225 |
7 | 521102363 |
oct | 164602131 |
9 | 63528108 |
10 | 30606425 |
11 | 16305073 |
12 | a300075 |
13 | 6458015 |
14 | 40c9d33 |
15 | 2a48885 |
hex | 1d30459 |
30606425 has 6 divisors (see below), whose sum is σ = 37951998. Its totient is φ = 24485120.
The previous prime is 30606421. The next prime is 30606431. The reversal of 30606425 is 52460603.
It can be written as a sum of positive squares in 3 ways, for example, as 5285401 + 25321024 = 2299^2 + 5032^2 .
It is not a de Polignac number, because 30606425 - 22 = 30606421 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30606394 and 30606403.
It is not an unprimeable number, because it can be changed into a prime (30606421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 612104 + ... + 612153.
It is an arithmetic number, because the mean of its divisors is an integer number (6325333).
Almost surely, 230606425 is an apocalyptic number.
It is an amenable number.
30606425 is a deficient number, since it is larger than the sum of its proper divisors (7345573).
30606425 is a wasteful number, since it uses less digits than its factorization.
30606425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224267 (or 1224262 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 30606425 is about 5532.3073848079. The cubic root of 30606425 is about 312.8029701741.
It can be divided in two parts, 30606 and 425, that multiplied together give a triangular number (13007550 = T5100).
The spelling of 30606425 in words is "thirty million, six hundred six thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •