Base | Representation |
---|---|
bin | 1110111100100010… |
… | …0101101000001100 |
3 | 101100121022000110010 |
4 | 3233020211220030 |
5 | 31204033142100 |
6 | 1502035113220 |
7 | 201264326130 |
oct | 35710455014 |
9 | 11317260403 |
10 | 4012005900 |
11 | 1779744461 |
12 | 93b742810 |
13 | 4bc2662b6 |
14 | 2a0b9b3c0 |
15 | 187347750 |
hex | ef225a0c |
4012005900 has 144 divisors (see below), whose sum is σ = 13491636480. Its totient is φ = 901459200.
The previous prime is 4012005889. The next prime is 4012005911. The reversal of 4012005900 is 95002104.
It is an interprime number because it is at equal distance from previous prime (4012005889) and next prime (4012005911).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 107710 + ... + 140090.
It is an arithmetic number, because the mean of its divisors is an integer number (93691920).
Almost surely, 24012005900 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 4012005900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6745818240).
4012005900 is an abundant number, since it is smaller than the sum of its proper divisors (9479630580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4012005900 is a wasteful number, since it uses less digits than its factorization.
4012005900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32464 (or 32457 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 4012005900 is about 63340.3970622225. The cubic root of 4012005900 is about 1588.9876471743.
The spelling of 4012005900 in words is "four billion, twelve million, five thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •