Base | Representation |
---|---|
bin | 10101011100011101… |
… | …00111100001011101 |
3 | 1002201100202002210100 |
4 | 22232032213201131 |
5 | 142034312031302 |
6 | 5142231331313 |
7 | 555205621503 |
oct | 125616474135 |
9 | 32640662710 |
10 | 11513002077 |
11 | 4978875955 |
12 | 2293820b39 |
13 | 11162b2885 |
14 | 7b308c673 |
15 | 475b24d1c |
hex | 2ae3a785d |
11513002077 has 24 divisors (see below), whose sum is σ = 16996097664. Its totient is φ = 7506555264.
The previous prime is 11513002069. The next prime is 11513002087. The reversal of 11513002077 is 77020031511.
It is a happy number.
11513002077 is a `hidden beast` number, since 1 + 151 + 300 + 207 + 7 = 666.
It is not a de Polignac number, because 11513002077 - 23 = 11513002069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11513002077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11513002027) 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 23 ways as a sum of consecutive naturals, for example, 618133 + ... + 636485.
It is an arithmetic number, because the mean of its divisors is an integer number (708170736).
Almost surely, 211513002077 is an apocalyptic number.
It is an amenable number.
11513002077 is a deficient number, since it is larger than the sum of its proper divisors (5483095587).
11513002077 is a wasteful number, since it uses less digits than its factorization.
11513002077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19889 (or 19886 counting only the distinct ones).
The product of its (nonzero) digits is 1470, while the sum is 27.
Adding to 11513002077 its reverse (77020031511), we get a palindrome (88533033588).
The spelling of 11513002077 in words is "eleven billion, five hundred thirteen million, two thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •