Base | Representation |
---|---|
bin | 11001101010011001101010… |
… | …01001010111000000000000 |
3 | 21101210220001122120001000000 |
4 | 30311030311021113000000 |
5 | 24344042143014314341 |
6 | 320004414544000000 |
7 | 14613053065351551 |
oct | 1465146511270000 |
9 | 241726048501000 |
10 | 56432466948096 |
11 | 16a87969445548 |
12 | 63b4ba7000000 |
13 | 25647358b24a5 |
14 | dd14bb4d0328 |
15 | 67ce109b78b6 |
hex | 335335257000 |
56432466948096 has 728 divisors, whose sum is σ = 179388732516224. Its totient is φ = 17710946058240.
The previous prime is 56432466948073. The next prime is 56432466948181. The reversal of 56432466948096 is 69084966423465.
56432466948096 is a `hidden beast` number, since 5 + 6 + 4 + 32 + 466 + 9 + 48 + 0 + 96 = 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 55 ways as a sum of consecutive naturals, for example, 3424915410 + ... + 3424931886.
Almost surely, 256432466948096 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 56432466948096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89694366258112).
56432466948096 is an abundant number, since it is smaller than the sum of its proper divisors (122956265568128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56432466948096 is an equidigital number, since it uses as much as digits as its factorization.
56432466948096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16587 (or 16550 counting only the distinct ones).
The product of its (nonzero) digits is 1612431360, while the sum is 72.
The spelling of 56432466948096 in words is "fifty-six trillion, four hundred thirty-two billion, four hundred sixty-six million, nine hundred forty-eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •