Base | Representation |
---|---|
bin | 10001111000011… |
… | …111000110010000 |
3 | 202220112121020000 |
4 | 101320133012100 |
5 | 1103301120422 |
6 | 45434250000 |
7 | 10302062130 |
oct | 2170370620 |
9 | 686477200 |
10 | 300020112 |
11 | 144398607 |
12 | 84586900 |
13 | 4a206cc2 |
14 | 2bbbaac0 |
15 | 1b514cac |
hex | 11e1f190 |
300020112 has 100 divisors (see below), whose sum is σ = 992424576. Its totient is φ = 85717440.
The previous prime is 300020111. The next prime is 300020113. The reversal of 300020112 is 211020003.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (300020111) and next prime (300020113).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 300020094 and 300020103.
It is not an unprimeable number, because it can be changed into a prime (300020111) 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 19 ways as a sum of consecutive naturals, for example, 7464 + ... + 25607.
Almost surely, 2300020112 is an apocalyptic number.
It is an amenable number.
300020112 is an abundant number, since it is smaller than the sum of its proper divisors (692404464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300020112 is a wasteful number, since it uses less digits than its factorization.
300020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33098 (or 33083 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 300020112 is about 17321.0886493892. The cubic root of 300020112 is about 669.4479093429.
Adding to 300020112 its reverse (211020003), we get a palindrome (511040115).
The spelling of 300020112 in words is "three hundred million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •