Base | Representation |
---|---|
bin | 1000110010000011… |
… | …00100000100111000 |
3 | 110011120202001011000 |
4 | 10121001210010320 |
5 | 34123442320413 |
6 | 2055502405000 |
7 | 224560126530 |
oct | 43101440470 |
9 | 13146661130 |
10 | 4714807608 |
11 | 1aaa427815 |
12 | ab6b90760 |
13 | 5a1a469b4 |
14 | 32a2644c0 |
15 | 1c8dc0073 |
hex | 119064138 |
4714807608 has 512 divisors, whose sum is σ = 16798924800. Its totient is φ = 1194393600.
The previous prime is 4714807571. The next prime is 4714807609. The reversal of 4714807608 is 8067084174.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4714807609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 48606216 + ... + 48606312.
It is an arithmetic number, because the mean of its divisors is an integer number (32810400).
Almost surely, 24714807608 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 4714807608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8399462400).
4714807608 is an abundant number, since it is smaller than the sum of its proper divisors (12084117192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4714807608 is a wasteful number, since it uses less digits than its factorization.
4714807608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 301056, while the sum is 45.
The square root of 4714807608 is about 68664.4566569925. The cubic root of 4714807608 is about 1676.8259713612.
The spelling of 4714807608 in words is "four billion, seven hundred fourteen million, eight hundred seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •