Base | Representation |
---|---|
bin | 10101100010101011… |
… | …00101101001011111 |
3 | 1002211222220001110100 |
4 | 22301111211221133 |
5 | 142141140123210 |
6 | 5151333312143 |
7 | 556411150500 |
oct | 126125455137 |
9 | 32758801410 |
10 | 11565161055 |
11 | 49a5260748 |
12 | 22a9195653 |
13 | 1124045886 |
14 | 7b9d88ba7 |
15 | 47a4c95c0 |
hex | 2b1565a5f |
11565161055 has 72 divisors (see below), whose sum is σ = 23533567200. Its totient is φ = 5238317952.
The previous prime is 11565161039. The next prime is 11565161057. The reversal of 11565161055 is 55016156511.
It is a happy number.
It is not a de Polignac number, because 11565161055 - 24 = 11565161039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11565161057) 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 in 71 ways as a sum of consecutive naturals, for example, 216286 + ... + 264404.
It is an arithmetic number, because the mean of its divisors is an integer number (326855100).
Almost surely, 211565161055 is an apocalyptic number.
11565161055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11565161055 is an abundant number, since it is smaller than the sum of its proper divisors (11968406145).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11565161055 is a wasteful number, since it uses less digits than its factorization.
11565161055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48253 (or 48243 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 11565161055 in words is "eleven billion, five hundred sixty-five million, one hundred sixty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •