Base | Representation |
---|---|
bin | 111010011010… |
… | …0000101001001 |
3 | 2010121202112002 |
4 | 1310310011021 |
5 | 30314401100 |
6 | 3012200345 |
7 | 521166020 |
oct | 164640511 |
9 | 63552462 |
10 | 30622025 |
11 | 16315865 |
12 | a3090b5 |
13 | 6462155 |
14 | 40d18b7 |
15 | 2a4d2d5 |
hex | 1d34149 |
30622025 has 24 divisors (see below), whose sum is σ = 43640064. Its totient is φ = 20880000.
The previous prime is 30622021. The next prime is 30622037. The reversal of 30622025 is 52022603.
It is a happy number.
It is not a de Polignac number, because 30622025 - 22 = 30622021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30621988 and 30622006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30622021) 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 23 ways as a sum of consecutive naturals, for example, 40400 + ... + 41150.
It is an arithmetic number, because the mean of its divisors is an integer number (1818336).
Almost surely, 230622025 is an apocalyptic number.
30622025 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30622025 is a deficient number, since it is larger than the sum of its proper divisors (13018039).
30622025 is a wasteful number, since it uses less digits than its factorization.
30622025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001 (or 996 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 30622025 is about 5533.7171051654. The cubic root of 30622025 is about 312.8561060490.
Adding to 30622025 its reverse (52022603), we get a palindrome (82644628).
The spelling of 30622025 in words is "thirty million, six hundred twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •