Base | Representation |
---|---|
bin | 10100101101101110… |
… | …10010010110110101 |
3 | 1001201001010211220000 |
4 | 22112313102112311 |
5 | 140233434310401 |
6 | 5035305501513 |
7 | 542406011655 |
oct | 122667222665 |
9 | 31631124800 |
10 | 11121010101 |
11 | 479757a543 |
12 | 21a44a1899 |
13 | 1083016266 |
14 | 776db0365 |
15 | 4514e4186 |
hex | 296dd25b5 |
11121010101 has 20 divisors (see below), whose sum is σ = 16885216524. Its totient is φ = 7292462400.
The previous prime is 11121010073. The next prime is 11121010129. The reversal of 11121010101 is 10101012111.
It is an interprime number because it is at equal distance from previous prime (11121010073) and next prime (11121010129).
It can be written as a sum of positive squares in 2 ways, for example, as 1952756100 + 9168254001 = 44190^2 + 95751^2 .
It is not a de Polignac number, because 11121010101 - 211 = 11121008053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121010171) 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 19 ways as a sum of consecutive naturals, for example, 1120440 + ... + 1130321.
Almost surely, 211121010101 is an apocalyptic number.
It is an amenable number.
11121010101 is a deficient number, since it is larger than the sum of its proper divisors (5764206423).
11121010101 is an equidigital number, since it uses as much as digits as its factorization.
11121010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2250834 (or 2250825 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11121010101 its reverse (10101012111), we get a palindrome (21222022212).
The spelling of 11121010101 in words is "eleven billion, one hundred twenty-one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •