Base | Representation |
---|---|
bin | 11001011111101110001001… |
… | …00011011100010011100000 |
3 | 21100111210212111022012012121 |
4 | 30233313010203130103200 |
5 | 24322034123432140000 |
6 | 315124045431434024 |
7 | 14544412332506161 |
oct | 1457670443342340 |
9 | 240453774265177 |
10 | 56065505740000 |
11 | 1695627a402549 |
12 | 6355a54525914 |
13 | 2538c54083473 |
14 | dbb829199768 |
15 | 6735d48a0b1a |
hex | 32fdc48dc4e0 |
56065505740000 has 120 divisors (see below), whose sum is σ = 138843002179728. Its totient is φ = 22277683200000.
The previous prime is 56065505739941. The next prime is 56065505740007. The reversal of 56065505740000 is 4750556065.
56065505740000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56065505740007) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 6262369 + ... + 12302368.
Almost surely, 256065505740000 is an apocalyptic number.
56065505740000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56065505740000 is an abundant number, since it is smaller than the sum of its proper divisors (82777496439728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56065505740000 is a wasteful number, since it uses less digits than its factorization.
56065505740000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18564918 (or 18564895 counting only the distinct ones).
The product of its (nonzero) digits is 630000, while the sum is 43.
The spelling of 56065505740000 in words is "fifty-six trillion, sixty-five billion, five hundred five million, seven hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •