Base | Representation |
---|---|
bin | 101001011000010010100… |
… | …1011011010110000000000 |
3 | 202010200112222201210210000 |
4 | 1102300211023122300000 |
5 | 1221134301033400143 |
6 | 20032351225440000 |
7 | 1124612065133340 |
oct | 122604513326000 |
9 | 22120488653700 |
10 | 5687160450048 |
11 | 18a2a028a0250 |
12 | 77a262640000 |
13 | 3233b2479a6c |
14 | 15938d76ad20 |
15 | 9ce094bcbd3 |
hex | 52c252dac00 |
5687160450048 has 880 divisors, whose sum is σ = 21236374266624. Its totient is φ = 1472806748160.
The previous prime is 5687160449977. The next prime is 5687160450053. The reversal of 5687160450048 is 8400540617865.
5687160450048 is a `hidden beast` number, since 5 + 6 + 8 + 71 + 60 + 4 + 500 + 4 + 8 = 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 = 5687160449976 and 5687160450003.
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, 2535514015 + ... + 2535516257.
Almost surely, 25687160450048 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 5687160450048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10618187133312).
5687160450048 is an abundant number, since it is smaller than the sum of its proper divisors (15549213816576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5687160450048 is a wasteful number, since it uses less digits than its factorization.
5687160450048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2690 (or 2663 counting only the distinct ones).
The product of its (nonzero) digits is 6451200, while the sum is 54.
The spelling of 5687160450048 in words is "five trillion, six hundred eighty-seven billion, one hundred sixty million, four hundred fifty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •