Base | Representation |
---|---|
bin | 10101011011100001… |
… | …11001001011110101 |
3 | 1002200211002020012122 |
4 | 22231300321023311 |
5 | 142030313210401 |
6 | 5141352325325 |
7 | 555052446410 |
oct | 125560711365 |
9 | 32624066178 |
10 | 11505210101 |
11 | 4974433700 |
12 | 22910a3845 |
13 | 11147b5038 |
14 | 7b2020b77 |
15 | 4750d621b |
hex | 2adc392f5 |
11505210101 has 48 divisors (see below), whose sum is σ = 14645917440. Its totient is φ = 8846323200.
The previous prime is 11505210083. The next prime is 11505210103. The reversal of 11505210101 is 10101250511.
It is not a de Polignac number, because 11505210101 - 218 = 11504947957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11505210101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11505210103) 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 47 ways as a sum of consecutive naturals, for example, 32047760 + ... + 32048118.
It is an arithmetic number, because the mean of its divisors is an integer number (305123280).
Almost surely, 211505210101 is an apocalyptic number.
11505210101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11505210101 is a deficient number, since it is larger than the sum of its proper divisors (3140707339).
11505210101 is a wasteful number, since it uses less digits than its factorization.
11505210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786 (or 775 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 17.
Adding to 11505210101 its reverse (10101250511), we get a palindrome (21606460612).
The spelling of 11505210101 in words is "eleven billion, five hundred five million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •