Base | Representation |
---|---|
bin | 111010000111… |
… | …0000101000000 |
3 | 2010022212000000 |
4 | 1310032011000 |
5 | 30244410433 |
6 | 3005000000 |
7 | 516650142 |
oct | 164160500 |
9 | 63285000 |
10 | 30466368 |
11 | 16219919 |
12 | a253000 |
13 | 640934a |
14 | 4090c92 |
15 | 2a1c113 |
hex | 1d0e140 |
30466368 has 98 divisors (see below), whose sum is σ = 90782394. Its totient is φ = 10139904.
The previous prime is 30466357. The next prime is 30466369. The reversal of 30466368 is 86366403.
It can be written as a sum of positive squares in only one way, i.e., 22581504 + 7884864 = 4752^2 + 2808^2 .
It is a super-2 number, since 2×304663682 = 1856399158222848, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30466369) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 46330 + ... + 46982.
Almost surely, 230466368 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 30466368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45391197).
30466368 is an abundant number, since it is smaller than the sum of its proper divisors (60316026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30466368 is an frugal number, since it uses more digits than its factorization.
30466368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683 (or 658 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The square root of 30466368 is about 5519.6347705260. The cubic root of 30466368 is about 312.3251049091.
The spelling of 30466368 in words is "thirty million, four hundred sixty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •