Base | Representation |
---|---|
bin | 1001110010110001… |
… | …00100001000001000 |
3 | 111120102022020112102 |
4 | 10321120210020020 |
5 | 41231433124130 |
6 | 2225414532532 |
7 | 244201531604 |
oct | 47130441010 |
9 | 14512266472 |
10 | 5257708040 |
11 | 2258925962 |
12 | 1028967148 |
13 | 65a36c860 |
14 | 37c3c6504 |
15 | 20b8ae645 |
hex | 139624208 |
5257708040 has 128 divisors (see below), whose sum is σ = 13197824640. Its totient is φ = 1872654336.
The previous prime is 5257708013. The next prime is 5257708061. The reversal of 5257708040 is 408077525.
It is a junction number, because it is equal to n+sod(n) for n = 5257707985 and 5257708003.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1854464 + ... + 1857296.
It is an arithmetic number, because the mean of its divisors is an integer number (103108005).
Almost surely, 25257708040 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 5257708040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6598912320).
5257708040 is an abundant number, since it is smaller than the sum of its proper divisors (7940116600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5257708040 is a wasteful number, since it uses less digits than its factorization.
5257708040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2983 (or 2979 counting only the distinct ones).
The product of its (nonzero) digits is 78400, while the sum is 38.
The square root of 5257708040 is about 72510.0547510481. The cubic root of 5257708040 is about 1738.8634891243.
The spelling of 5257708040 in words is "five billion, two hundred fifty-seven million, seven hundred eight thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •