Base | Representation |
---|---|
bin | 1111001100110010… |
… | …1110010110101000 |
3 | 101112100121120220110 |
4 | 3303030232112220 |
5 | 31324012332310 |
6 | 1512512454320 |
7 | 203053056066 |
oct | 36314562650 |
9 | 11470546813 |
10 | 4080199080 |
11 | 1804190a61 |
12 | 95a54a3a0 |
13 | 5004215a9 |
14 | 2a9c6d036 |
15 | 18d317d20 |
hex | f332e5a8 |
4080199080 has 256 divisors, whose sum is σ = 13913856000. Its totient is φ = 951616512.
The previous prime is 4080199073. The next prime is 4080199127. The reversal of 4080199080 is 809910804.
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 63 ways as a sum of consecutive naturals, for example, 1519419 + ... + 1522101.
It is an arithmetic number, because the mean of its divisors is an integer number (54351000).
Almost surely, 24080199080 is an apocalyptic number.
4080199080 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 4080199080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6956928000).
4080199080 is an abundant number, since it is smaller than the sum of its proper divisors (9833656920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4080199080 is a wasteful number, since it uses less digits than its factorization.
4080199080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768 (or 2764 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 39.
The square root of 4080199080 is about 63876.4360308244. The cubic root of 4080199080 is about 1597.9399372685.
The spelling of 4080199080 in words is "four billion, eighty million, one hundred ninety-nine thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •