Base | Representation |
---|---|
bin | 100110100110001010011… |
… | …0011010110000100011000 |
3 | 200210010012001000011110110 |
4 | 1031030110303112010120 |
5 | 1143402342201131431 |
6 | 15140525352044320 |
7 | 1055150523522150 |
oct | 115142463260430 |
9 | 20703161004413 |
10 | 5304633614616 |
11 | 1765756425026 |
12 | 7180a70936a0 |
13 | 2c62bcb7c46b |
14 | 144a62055760 |
15 | 92ebbab3346 |
hex | 4d314cd6118 |
5304633614616 has 256 divisors, whose sum is σ = 16614954316800. Its totient is φ = 1376110116864.
The previous prime is 5304633614561. The next prime is 5304633614659. The reversal of 5304633614616 is 6164163364035.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 100770495 + ... + 100823121.
It is an arithmetic number, because the mean of its divisors is an integer number (64902165300).
Almost surely, 25304633614616 is an apocalyptic number.
5304633614616 is a gapful number since it is divisible by the number (56) 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 5304633614616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8307477158400).
5304633614616 is an abundant number, since it is smaller than the sum of its proper divisors (11310320702184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5304633614616 is a wasteful number, since it uses less digits than its factorization.
5304633614616 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53906 (or 53902 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 48.
The spelling of 5304633614616 in words is "five trillion, three hundred four billion, six hundred thirty-three million, six hundred fourteen thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •