Base | Representation |
---|---|
bin | 10100011111111001… |
… | …11101001001001100 |
3 | 1001101221221202011112 |
4 | 22033330331021030 |
5 | 140014243234224 |
6 | 5020004311152 |
7 | 536500300046 |
oct | 121774751114 |
9 | 31357852145 |
10 | 11005055564 |
11 | 4738081148 |
12 | 21716a24b8 |
13 | 1064ca77c9 |
14 | 765828a96 |
15 | 44623c30e |
hex | 28ff3d24c |
11005055564 has 6 divisors (see below), whose sum is σ = 19258847244. Its totient is φ = 5502527780.
The previous prime is 11005055563. The next prime is 11005055597. The reversal of 11005055564 is 46555050011.
It is a super-2 number, since 2×110050555642 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11005055564.
It is not an unprimeable number, because it can be changed into a prime (11005055561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1375631942 + ... + 1375631949.
It is an arithmetic number, because the mean of its divisors is an integer number (3209807874).
Almost surely, 211005055564 is an apocalyptic number.
It is an amenable number.
11005055564 is a deficient number, since it is larger than the sum of its proper divisors (8253791680).
11005055564 is a wasteful number, since it uses less digits than its factorization.
11005055564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2751263895 (or 2751263893 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 11005055564 in words is "eleven billion, five million, fifty-five thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •