Base | Representation |
---|---|
bin | 111001011010… |
… | …1100111011001 |
3 | 2002122102221220 |
4 | 1302311213121 |
5 | 30201312100 |
6 | 2553122253 |
7 | 513610560 |
oct | 162654731 |
9 | 62572856 |
10 | 30104025 |
11 | 15aa1666 |
12 | a0b9389 |
13 | 6310443 |
14 | 3dd8bd7 |
15 | 2999aa0 |
hex | 1cb59d9 |
30104025 has 48 divisors (see below), whose sum is σ = 60246144. Its totient is φ = 12948480.
The previous prime is 30104023. The next prime is 30104077. The reversal of 30104025 is 52040103.
It is not a de Polignac number, because 30104025 - 21 = 30104023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 30103995 and 30104013.
It is not an unprimeable number, because it can be changed into a prime (30104021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7239 + ... + 10611.
It is an arithmetic number, because the mean of its divisors is an integer number (1255128).
Almost surely, 230104025 is an apocalyptic number.
30104025 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
30104025 is an abundant number, since it is smaller than the sum of its proper divisors (30142119).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30104025 is a wasteful number, since it uses less digits than its factorization.
30104025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3410 (or 3405 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 30104025 is about 5486.7134971675. The cubic root of 30104025 is about 311.0819805727.
Adding to 30104025 its reverse (52040103), we get a palindrome (82144128).
The spelling of 30104025 in words is "thirty million, one hundred four thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •