Base | Representation |
---|---|
bin | 1110111110100000… |
… | …1011110100011000 |
3 | 101101011212211102220 |
4 | 3233220023310120 |
5 | 31213143220132 |
6 | 1502532424040 |
7 | 201424614402 |
oct | 35750136430 |
9 | 11334784386 |
10 | 4020288792 |
11 | 1783391523 |
12 | 942478020 |
13 | 4c0ba6410 |
14 | 2a1d15b72 |
15 | 187e31a2c |
hex | efa0bd18 |
4020288792 has 256 divisors, whose sum is σ = 12083904000. Its totient is φ = 1102553088.
The previous prime is 4020288791. The next prime is 4020288803. The reversal of 4020288792 is 2978820204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4020288791) by changing a digit.
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, 9074923 + ... + 9075365.
It is an arithmetic number, because the mean of its divisors is an integer number (47202750).
Almost surely, 24020288792 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 4020288792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6041952000).
4020288792 is an abundant number, since it is smaller than the sum of its proper divisors (8063615208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4020288792 is a wasteful number, since it uses less digits than its factorization.
4020288792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570 (or 566 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 42.
The square root of 4020288792 is about 63405.7473104765. The cubic root of 4020288792 is about 1590.0803978175.
The spelling of 4020288792 in words is "four billion, twenty million, two hundred eighty-eight thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •