Base | Representation |
---|---|
bin | 111010000000… |
… | …1111001110000 |
3 | 2010020022120220 |
4 | 1310001321300 |
5 | 30241311441 |
6 | 3003533040 |
7 | 516351555 |
oct | 164017160 |
9 | 63208526 |
10 | 30416496 |
11 | 16195400 |
12 | a22a180 |
13 | 63bc736 |
14 | 407aa2c |
15 | 2a0c466 |
hex | 1d01e70 |
30416496 has 60 divisors (see below), whose sum is σ = 86385096. Its totient is φ = 9215360.
The previous prime is 30416483. The next prime is 30416509. The reversal of 30416496 is 69461403.
It is an interprime number because it is at equal distance from previous prime (30416483) and next prime (30416509).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3190 + ... + 8426.
Almost surely, 230416496 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30416496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43192548).
30416496 is an abundant number, since it is smaller than the sum of its proper divisors (55968600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30416496 is a wasteful number, since it uses less digits than its factorization.
30416496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5270 (or 5253 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 30416496 is about 5515.1152299839. The cubic root of 30416496 is about 312.1545913712.
Adding to 30416496 its reverse (69461403), we get a palindrome (99877899).
The spelling of 30416496 in words is "thirty million, four hundred sixteen thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •