Base | Representation |
---|---|
bin | 111001101000… |
… | …0111100100010 |
3 | 2002212010112000 |
4 | 1303100330202 |
5 | 30213402340 |
6 | 2555344430 |
7 | 514555131 |
oct | 163207442 |
9 | 62763460 |
10 | 30215970 |
11 | 16068784 |
12 | a152116 |
13 | 634c395 |
14 | 4027918 |
15 | 29bcd30 |
hex | 1cd0f22 |
30215970 has 128 divisors (see below), whose sum is σ = 88646400. Its totient is φ = 7289856.
The previous prime is 30215957. The next prime is 30215981. The reversal of 30215970 is 7951203.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 132997 + ... + 133223.
It is an arithmetic number, because the mean of its divisors is an integer number (692550).
Almost surely, 230215970 is an apocalyptic number.
30215970 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 30215970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44323200).
30215970 is an abundant number, since it is smaller than the sum of its proper divisors (58430430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30215970 is a wasteful number, since it uses less digits than its factorization.
30215970 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289 (or 283 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 30215970 is about 5496.9054930934. The cubic root of 30215970 is about 311.4671006755.
It can be divided in two parts, 30 and 215970, that added together give a cube (216000 = 603).
The spelling of 30215970 in words is "thirty million, two hundred fifteen thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •