Base | Representation |
---|---|
bin | 111010001011… |
… | …1101000011100 |
3 | 2010101211200100 |
4 | 1310113220130 |
5 | 30302134000 |
6 | 3005501100 |
7 | 520202214 |
oct | 164275034 |
9 | 63354610 |
10 | 30505500 |
11 | 16246263 |
12 | a271790 |
13 | 64210bc |
14 | 40a1244 |
15 | 2a28a00 |
hex | 1d17a1c |
30505500 has 72 divisors (see below), whose sum is σ = 96248880. Its totient is φ = 8133600.
The previous prime is 30505499. The next prime is 30505529. The reversal of 30505500 is 550503.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1111 + ... + 7889.
It is an arithmetic number, because the mean of its divisors is an integer number (1336790).
Almost surely, 230505500 is an apocalyptic number.
30505500 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30505500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48124440).
30505500 is an abundant number, since it is smaller than the sum of its proper divisors (65743380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30505500 is a wasteful number, since it uses less digits than its factorization.
30505500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6804 (or 6789 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 18.
The square root of 30505500 is about 5523.1784327505. The cubic root of 30505500 is about 312.4587678933.
The spelling of 30505500 in words is "thirty million, five hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •