Base | Representation |
---|---|
bin | 100101011111101101001… |
… | …1100010000000000000000 |
3 | 200020122122110202000000000 |
4 | 1022333122130100000000 |
5 | 1133413010120022220 |
6 | 14543224000000000 |
7 | 1041213223403664 |
oct | 112773234200000 |
9 | 20218573660000 |
10 | 5153330626560 |
11 | 1707573878746 |
12 | 6b2900000000 |
13 | 2b4c59689c6c |
14 | 13b5cb6068a4 |
15 | 8e0b3903390 |
hex | 4afda710000 |
5153330626560 has 1360 divisors, whose sum is σ = 20060733217536. Its totient is φ = 1265866113024.
The previous prime is 5153330626541. The next prime is 5153330626597. The reversal of 5153330626560 is 656260333515.
5153330626560 is a `hidden beast` number, since 5 + 1 + 5 + 33 + 30 + 6 + 26 + 560 = 666.
It is a tau number, because it is divible by the number of its divisors (1360).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 109645332457 + ... + 109645332503.
Almost surely, 25153330626560 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 5153330626560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10030366608768).
5153330626560 is an abundant number, since it is smaller than the sum of its proper divisors (14907402590976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5153330626560 is an frugal number, since it uses more digits than its factorization.
5153330626560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128 (or 74 counting only the distinct ones).
The product of its (nonzero) digits is 1458000, while the sum is 45.
The spelling of 5153330626560 in words is "five trillion, one hundred fifty-three billion, three hundred thirty million, six hundred twenty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •