Base | Representation |
---|---|
bin | 1111001001101001… |
… | …0111110001101000 |
3 | 101111102202222100102 |
4 | 3302122113301220 |
5 | 31312122440100 |
6 | 1511321524532 |
7 | 202532632052 |
oct | 36232276150 |
9 | 11442688312 |
10 | 4066999400 |
11 | 17a7795932 |
12 | 956043748 |
13 | 4ca77c529 |
14 | 2a81d48d2 |
15 | 18c0abcd5 |
hex | f2697c68 |
4066999400 has 96 divisors (see below), whose sum is σ = 9976370400. Its totient is φ = 1537632000.
The previous prime is 4066999397. The next prime is 4066999423. The reversal of 4066999400 is 49996604.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2138450 + ... + 2140350.
It is an arithmetic number, because the mean of its divisors is an integer number (103920525).
Almost surely, 24066999400 is an apocalyptic number.
4066999400 is a gapful number since it is divisible by the number (40) 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 4066999400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4988185200).
4066999400 is an abundant number, since it is smaller than the sum of its proper divisors (5909371000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4066999400 is a wasteful number, since it uses less digits than its factorization.
4066999400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2499 (or 2490 counting only the distinct ones).
The product of its (nonzero) digits is 419904, while the sum is 47.
The square root of 4066999400 is about 63773.0303498273. The cubic root of 4066999400 is about 1596.2149330619.
The spelling of 4066999400 in words is "four billion, sixty-six million, nine hundred ninety-nine thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •