Base | Representation |
---|---|
bin | 111010000110… |
… | …0100011011101 |
3 | 2010022112102210 |
4 | 1310030203131 |
5 | 30244211000 |
6 | 3004511033 |
7 | 516623013 |
oct | 164144335 |
9 | 63275383 |
10 | 30460125 |
11 | 16215163 |
12 | a24b479 |
13 | 6406557 |
14 | 408c8b3 |
15 | 2a1a350 |
hex | 1d0c8dd |
30460125 has 32 divisors (see below), whose sum is σ = 51891840. Its totient is φ = 15859200.
The previous prime is 30460123. The next prime is 30460127. The reversal of 30460125 is 52106403.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (30460123) and next prime (30460127).
It is not a de Polignac number, because 30460125 - 21 = 30460123 is a prime.
It is a super-3 number, since 3×304601253 (a number of 23 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30460123) 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 in 31 ways as a sum of consecutive naturals, for example, 15181 + ... + 17069.
It is an arithmetic number, because the mean of its divisors is an integer number (1621620).
Almost surely, 230460125 is an apocalyptic number.
It is an amenable number.
30460125 is a deficient number, since it is larger than the sum of its proper divisors (21431715).
30460125 is a wasteful number, since it uses less digits than its factorization.
30460125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1950 (or 1940 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 30460125 is about 5519.0692150036. The cubic root of 30460125 is about 312.3037701394.
Adding to 30460125 its reverse (52106403), we get a palindrome (82566528).
The spelling of 30460125 in words is "thirty million, four hundred sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •