Base | Representation |
---|---|
bin | 1011001011010000… |
… | …1010110010010000 |
3 | 21202002001210221000 |
4 | 2302310022302100 |
5 | 22121001120422 |
6 | 1213404502000 |
7 | 134225515215 |
oct | 26264126220 |
9 | 7662053830 |
10 | 3000020112 |
11 | 12aa484571 |
12 | 6b884a900 |
13 | 38a6c073b |
14 | 20660db0c |
15 | 128599cac |
hex | b2d0ac90 |
3000020112 has 80 divisors (see below), whose sum is σ = 8617752000. Its totient is φ = 999242496.
The previous prime is 3000020081. The next prime is 3000020113. The reversal of 3000020112 is 2110200003.
It is a happy number.
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 = 3000020094 and 3000020103.
It is not an unprimeable number, because it can be changed into a prime (3000020113) 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 15 ways as a sum of consecutive naturals, for example, 1008964 + ... + 1011932.
It is an arithmetic number, because the mean of its divisors is an integer number (107721900).
Almost surely, 23000020112 is an apocalyptic number.
It is an amenable number.
3000020112 is an abundant number, since it is smaller than the sum of its proper divisors (5617731888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3000020112 is a wasteful number, since it uses less digits than its factorization.
3000020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5325 (or 5313 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 3000020112 is about 54772.4393468102. The cubic root of 3000020112 is about 1442.2527932472.
Adding to 3000020112 its reverse (2110200003), we get a palindrome (5110220115).
The spelling of 3000020112 in words is "three billion, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •