Base | Representation |
---|---|
bin | 1001111000001100… |
… | …10100101000001000 |
3 | 111200121000101210110 |
4 | 10330012110220020 |
5 | 41330113220413 |
6 | 2234123114320 |
7 | 245263642305 |
oct | 47406245010 |
9 | 14617011713 |
10 | 5303257608 |
11 | 2281606a30 |
12 | 10400729a0 |
13 | 66692a36c |
14 | 3844820ac |
15 | 2108aa8c3 |
hex | 13c194a08 |
5303257608 has 128 divisors (see below), whose sum is σ = 14998608000. Its totient is φ = 1547857920.
The previous prime is 5303257607. The next prime is 5303257621. The reversal of 5303257608 is 8067523035.
It is not an unprimeable number, because it can be changed into a prime (5303257607) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5427616 + ... + 5428592.
It is an arithmetic number, because the mean of its divisors is an integer number (117176625).
Almost surely, 25303257608 is an apocalyptic number.
5303257608 is a gapful number since it is divisible by the number (58) 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 5303257608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7499304000).
5303257608 is an abundant number, since it is smaller than the sum of its proper divisors (9695350392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5303257608 is a wasteful number, since it uses less digits than its factorization.
5303257608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1735 (or 1731 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 39.
The square root of 5303257608 is about 72823.4687995566. The cubic root of 5303257608 is about 1743.8705408841.
The spelling of 5303257608 in words is "five billion, three hundred three million, two hundred fifty-seven thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •