Base | Representation |
---|---|
bin | 100101111000011100010… |
… | …0000011101011110000000 |
3 | 200102201202100012021111000 |
4 | 1023300320200131132000 |
5 | 1140300301242134120 |
6 | 15023450454052000 |
7 | 1045103434114014 |
oct | 113607040353600 |
9 | 20381670167430 |
10 | 5206448396160 |
11 | 172805142a190 |
12 | 70106504a000 |
13 | 2b9c73336b6b |
14 | 13ddca038544 |
15 | 90671d51990 |
hex | 4bc3881d780 |
5206448396160 has 256 divisors, whose sum is σ = 20115824083200. Its totient is φ = 1262169262080.
The previous prime is 5206448396113. The next prime is 5206448396167. The reversal of 5206448396160 is 616938446025.
5206448396160 is a `hidden beast` number, since 5 + 2 + 0 + 6 + 448 + 39 + 6 + 160 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 5206448396097 and 5206448396106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5206448396167) 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, 13505334 + ... + 13885493.
It is an arithmetic number, because the mean of its divisors is an integer number (78577437825).
Almost surely, 25206448396160 is an apocalyptic number.
It is an amenable number.
5206448396160 is an abundant number, since it is smaller than the sum of its proper divisors (14909375687040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5206448396160 is a wasteful number, since it uses less digits than its factorization.
5206448396160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27390866 (or 27390848 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 54.
The spelling of 5206448396160 in words is "five trillion, two hundred six billion, four hundred forty-eight million, three hundred ninety-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •