Base | Representation |
---|---|
bin | 11110101110001001010… |
… | …00111100110001110100 |
3 | 10201220121012202120022000 |
4 | 33113010220330301310 |
5 | 114243244402302224 |
6 | 2124530443535300 |
7 | 136155624303645 |
oct | 17270450746164 |
9 | 3656535676260 |
10 | 1055566056564 |
11 | 37773257a698 |
12 | 1506aab2a530 |
13 | 78702239b56 |
14 | 391380a76cc |
15 | 1c6ceac80c9 |
hex | f5c4a3cc74 |
1055566056564 has 24 divisors (see below), whose sum is σ = 2736652739520. Its totient is φ = 351855352152.
The previous prime is 1055566056553. The next prime is 1055566056607. The reversal of 1055566056564 is 4656506655501.
1055566056564 is a `hidden beast` number, since 10 + 5 + 5 + 5 + 6 + 6 + 0 + 565 + 64 = 666.
It is a super-2 number, since 2×10555660565642 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 1055566056564.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4886879784 + ... + 4886879999.
It is an arithmetic number, because the mean of its divisors is an integer number (114027197480).
Almost surely, 21055566056564 is an apocalyptic number.
It is an amenable number.
1055566056564 is an abundant number, since it is smaller than the sum of its proper divisors (1681086682956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055566056564 is a wasteful number, since it uses less digits than its factorization.
1055566056564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9773759796 (or 9773759788 counting only the distinct ones).
The product of its (nonzero) digits is 16200000, while the sum is 54.
The spelling of 1055566056564 in words is "one trillion, fifty-five billion, five hundred sixty-six million, fifty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •