Base | Representation |
---|---|
bin | 11001100101010001000011… |
… | …01110011110110101110000 |
3 | 21101012000200200012021202220 |
4 | 30302220201232132311300 |
5 | 24333144341123213310 |
6 | 315351401010241040 |
7 | 14564236204523544 |
oct | 1462504156366560 |
9 | 241160620167686 |
10 | 56256047476080 |
11 | 16a1a068232001 |
12 | 6386970586180 |
13 | 2550bcb9c106a |
14 | dc6b43055a24 |
15 | 6785377c6670 |
hex | 332a21b9ed70 |
56256047476080 has 40 divisors (see below), whose sum is σ = 174393747176592. Its totient is φ = 15001612660224.
The previous prime is 56256047476063. The next prime is 56256047476099. The reversal of 56256047476080 is 8067474065265.
It is a happy number.
56256047476080 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 (40).
It is a Harshad number since it is a multiple of its sum of digits (60).
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 7 ways as a sum of consecutive naturals, for example, 117200098669 + ... + 117200099148.
Almost surely, 256256047476080 is an apocalyptic number.
It is an amenable number.
56256047476080 is an abundant number, since it is smaller than the sum of its proper divisors (118137699700512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56256047476080 is a wasteful number, since it uses less digits than its factorization.
56256047476080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234400197833 (or 234400197827 counting only the distinct ones).
The product of its (nonzero) digits is 67737600, while the sum is 60.
The spelling of 56256047476080 in words is "fifty-six trillion, two hundred fifty-six billion, forty-seven million, four hundred seventy-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •