Base | Representation |
---|---|
bin | 1001110111001010… |
… | …10111000000100000 |
3 | 111122222202101120102 |
4 | 10323211113000200 |
5 | 41320410212413 |
6 | 2233214001532 |
7 | 245130333011 |
oct | 47345270040 |
9 | 14588671512 |
10 | 5294616608 |
11 | 2277744906 |
12 | 10391a62a8 |
13 | 664bc3248 |
14 | 383273008 |
15 | 20ec50458 |
hex | 13b957020 |
5294616608 has 54 divisors (see below), whose sum is σ = 11017545021. Its totient is φ = 2504271744.
The previous prime is 5294616581. The next prime is 5294616611. The reversal of 5294616608 is 8066164925.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 3052783504 + 2241833104 = 55252^2 + 47348^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=51452.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 7820366 + ... + 7821042.
Almost surely, 25294616608 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 5294616608
5294616608 is an abundant number, since it is smaller than the sum of its proper divisors (5722928413).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5294616608 is an frugal number, since it uses more digits than its factorization.
5294616608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1402 (or 698 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 47.
The square root of 5294616608 is about 72764.1162112205. The cubic root of 5294616608 is about 1742.9228858066.
The spelling of 5294616608 in words is "five billion, two hundred ninety-four million, six hundred sixteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •