Base | Representation |
---|---|
bin | 10000000000100011110… |
… | …011000000100101110101 |
3 | 10220011120201012020002010 |
4 | 100000203303000211311 |
5 | 121011012210431401 |
6 | 2201215022234433 |
7 | 142323543300243 |
oct | 20004363004565 |
9 | 3804521166063 |
10 | 1100112202101 |
11 | 394611727100 |
12 | 159261425a19 |
13 | 7c981101a53 |
14 | 3b362353793 |
15 | 1d93a765ed6 |
hex | 10023cc0975 |
1100112202101 has 24 divisors (see below), whose sum is σ = 1619205456960. Its totient is φ = 663873094720.
The previous prime is 1100112202097. The next prime is 1100112202151. The reversal of 1100112202101 is 1012022110011.
It is not a de Polignac number, because 1100112202101 - 22 = 1100112202097 is a prime.
It is a super-2 number, since 2×11001122021012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100112202151) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6418881 + ... + 6588038.
It is an arithmetic number, because the mean of its divisors is an integer number (67466894040).
Almost surely, 21100112202101 is an apocalyptic number.
1100112202101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1100112202101 is a deficient number, since it is larger than the sum of its proper divisors (519093254859).
1100112202101 is a wasteful number, since it uses less digits than its factorization.
1100112202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13007177 (or 13007166 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1100112202101 its reverse (1012022110011), we get a palindrome (2112134312112).
The spelling of 1100112202101 in words is "one trillion, one hundred billion, one hundred twelve million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •