Base | Representation |
---|---|
bin | 1010001100100000111101… |
… | …0110000111110110000101 |
3 | 1110200200021200110022210011 |
4 | 2203020033112013312011 |
5 | 2432131312224200401 |
6 | 35501505313230221 |
7 | 2234622163441261 |
oct | 243101726076605 |
9 | 43620250408704 |
10 | 11210122100101 |
11 | 36322057507a1 |
12 | 131071b262371 |
13 | 634157811472 |
14 | 2aa803ac10a1 |
15 | 1469035a9451 |
hex | a320f587d85 |
11210122100101 has 12 divisors (see below), whose sum is σ = 11328538908036. Its totient is φ = 11092492270080.
The previous prime is 11210122100069. The next prime is 11210122100119. The reversal of 11210122100101 is 10100122101211.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 186560069476 + 11023562030625 = 431926^2 + 3320175^2 .
It is not a de Polignac number, because 11210122100101 - 25 = 11210122100069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210122100501) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8504041 + ... + 9733393.
It is an arithmetic number, because the mean of its divisors is an integer number (944044909003).
Almost surely, 211210122100101 is an apocalyptic number.
It is an amenable number.
11210122100101 is a deficient number, since it is larger than the sum of its proper divisors (118416807935).
11210122100101 is an equidigital number, since it uses as much as digits as its factorization.
11210122100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1229992 (or 1229751 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11210122100101 its reverse (10100122101211), we get a palindrome (21310244201312).
The spelling of 11210122100101 in words is "eleven trillion, two hundred ten billion, one hundred twenty-two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •