Base | Representation |
---|---|
bin | 111001011010… |
… | …0101101001100 |
3 | 2002122020211221 |
4 | 1302310231030 |
5 | 30201202200 |
6 | 2553053124 |
7 | 513563656 |
oct | 162645514 |
9 | 62566757 |
10 | 30100300 |
11 | 15a9988a |
12 | a0b71a4 |
13 | 630b839 |
14 | 3dd76d6 |
15 | 299891a |
hex | 1cb4b4c |
30100300 has 36 divisors (see below), whose sum is σ = 65718016. Its totient is φ = 11966400.
The previous prime is 30100297. The next prime is 30100303. The reversal of 30100300 is 300103.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (30100297) and next prime (30100303).
It is not an unprimeable number, because it can be changed into a prime (30100303) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 17269 + ... + 18931.
Almost surely, 230100300 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 30100300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32859008).
30100300 is an abundant number, since it is smaller than the sum of its proper divisors (35617716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30100300 is a wasteful number, since it uses less digits than its factorization.
30100300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858 (or 1851 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 7.
The square root of 30100300 is about 5486.3740302681. The cubic root of 30100300 is about 311.0691491969.
Adding to 30100300 its reverse (300103), we get a palindrome (30400403).
The spelling of 30100300 in words is "thirty million, one hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •