Base | Representation |
---|---|
bin | 1010100111001001… |
… | …10001100111100000 |
3 | 112201001010111211000 |
4 | 11103210301213200 |
5 | 43131430213030 |
6 | 2341152552000 |
7 | 261115456335 |
oct | 52344614740 |
9 | 15631114730 |
10 | 5697116640 |
11 | 2463968066 |
12 | 112bb52600 |
13 | 6ca3cb747 |
14 | 3c08c898c |
15 | 235259860 |
hex | 1539319e0 |
5697116640 has 192 divisors, whose sum is σ = 20094117120. Its totient is φ = 1507484160.
The previous prime is 5697116639. The next prime is 5697116701. The reversal of 5697116640 is 466117965.
5697116640 is a `hidden beast` number, since 569 + 71 + 16 + 6 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 560887 + ... + 570953.
It is an arithmetic number, because the mean of its divisors is an integer number (104656860).
Almost surely, 25697116640 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 5697116640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10047058560).
5697116640 is an abundant number, since it is smaller than the sum of its proper divisors (14397000480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5697116640 is a wasteful number, since it uses less digits than its factorization.
5697116640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10222 (or 10208 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 5697116640 is about 75479.2464191317. The cubic root of 5697116640 is about 1786.0147326911.
The spelling of 5697116640 in words is "five billion, six hundred ninety-seven million, one hundred sixteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •