Base | Representation |
---|---|
bin | 100101100001101001111… |
… | …1011110101100100010000 |
3 | 200021001110012002000220100 |
4 | 1023003103323311210100 |
5 | 1134000043201334210 |
6 | 14545155204212400 |
7 | 1041422031233202 |
oct | 113032373654420 |
9 | 20231405060810 |
10 | 5157516433680 |
11 | 1709321630576 |
12 | 6b368999a100 |
13 | 2b5475936800 |
14 | 13b8a74c6772 |
15 | 8e25b12c5c0 |
hex | 4b0d3ef5910 |
5157516433680 has 360 divisors, whose sum is σ = 18788606755776. Its totient is φ = 1267302067200.
The previous prime is 5157516433637. The next prime is 5157516433681. The reversal of 5157516433680 is 863346157515.
5157516433680 is a `hidden beast` number, since 5 + 1 + 5 + 7 + 516 + 43 + 3 + 6 + 80 = 666.
It is a tau number, because it is divible by the number of its divisors (360).
It is not an unprimeable number, because it can be changed into a prime (5157516433681) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 69442165 + ... + 69516395.
Almost surely, 25157516433680 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 5157516433680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9394303377888).
5157516433680 is an abundant number, since it is smaller than the sum of its proper divisors (13631090322096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5157516433680 is a wasteful number, since it uses less digits than its factorization.
5157516433680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74847 (or 74825 counting only the distinct ones).
The product of its (nonzero) digits is 9072000, while the sum is 54.
The spelling of 5157516433680 in words is "five trillion, one hundred fifty-seven billion, five hundred sixteen million, four hundred thirty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •