Base | Representation |
---|---|
bin | 11001101011111100110000… |
… | …10100110101011100000000 |
3 | 21101222222101111102221001100 |
4 | 30311332120110311130000 |
5 | 24400430123122231123 |
6 | 320045054144534400 |
7 | 14616645400223130 |
oct | 1465763024653400 |
9 | 241888344387040 |
10 | 56485670508288 |
11 | 16aa84904727aa |
12 | 6403374921400 |
13 | 2569764269358 |
14 | dd3cc7494ac0 |
15 | 67e4c6710643 |
hex | 335f98535700 |
56485670508288 has 432 divisors, whose sum is σ = 196467458387200. Its totient is φ = 15289324480512.
The previous prime is 56485670508271. The next prime is 56485670508299. The reversal of 56485670508288 is 88280507658465.
56485670508288 is a `hidden beast` number, since 5 + 6 + 4 + 8 + 567 + 0 + 50 + 8 + 2 + 8 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 110366643 + ... + 110877261.
Almost surely, 256485670508288 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 56485670508288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98233729193600).
56485670508288 is an abundant number, since it is smaller than the sum of its proper divisors (139981787878912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56485670508288 is an equidigital number, since it uses as much as digits as its factorization.
56485670508288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510705 (or 510650 counting only the distinct ones).
The product of its (nonzero) digits is 1032192000, while the sum is 72.
The spelling of 56485670508288 in words is "fifty-six trillion, four hundred eighty-five billion, six hundred seventy million, five hundred eight thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •