Base | Representation |
---|---|
bin | 11001101000100011011101… |
… | …11101100111010110000000 |
3 | 21101120211021101200221211020 |
4 | 30310101232331213112000 |
5 | 24342022214141012100 |
6 | 315515322233345440 |
7 | 14605345451050164 |
oct | 1464215675472600 |
9 | 241524241627736 |
10 | 56369012438400 |
11 | 16a62a66a911a2 |
12 | 63a4838268280 |
13 | 255b76255552c |
14 | dcc3bbd20ca4 |
15 | 67b449d415a0 |
hex | 33446ef67580 |
56369012438400 has 192 divisors, whose sum is σ = 192067692037200. Its totient is φ = 14513400832000.
The previous prime is 56369012438393. The next prime is 56369012438467. The reversal of 56369012438400 is 483421096365.
56369012438400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (192).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100959051 + ... + 101515850.
Almost surely, 256369012438400 is an apocalyptic number.
56369012438400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56369012438400 is an abundant number, since it is smaller than the sum of its proper divisors (135698679598800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56369012438400 is a wasteful number, since it uses less digits than its factorization.
56369012438400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202474957 (or 202474940 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 51.
The spelling of 56369012438400 in words is "fifty-six trillion, three hundred sixty-nine billion, twelve million, four hundred thirty-eight thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •