Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …0100111011110001101001 |
3 | 1110100020000000220011111211 |
4 | 2201230020110323301221 |
5 | 2424021234321201301 |
6 | 35344231332153121 |
7 | 2224521251346244 |
oct | 241541024736151 |
9 | 43306000804454 |
10 | 11111220100201 |
11 | 35a42730943a1 |
12 | 12b55191687a1 |
13 | 627a25632330 |
14 | 2a5b007dc25b |
15 | 14406595d051 |
hex | a1b0853bc69 |
11111220100201 has 16 divisors (see below), whose sum is σ = 11991685886208. Its totient is φ = 10234437998400.
The previous prime is 11111220099989. The next prime is 11111220100217. The reversal of 11111220100201 is 10200102211111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11111220100201 - 213 = 11111220092009 is a prime.
It is a super-2 number, since 2×111112201002012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11111220100291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 68173116 + ... + 68335906.
It is an arithmetic number, because the mean of its divisors is an integer number (749480367888).
Almost surely, 211111220100201 is an apocalyptic number.
It is an amenable number.
11111220100201 is a deficient number, since it is larger than the sum of its proper divisors (880465786007).
11111220100201 is a wasteful number, since it uses less digits than its factorization.
11111220100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174072.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11111220100201 its reverse (10200102211111), we get a palindrome (21311322311312).
The spelling of 11111220100201 in words is "eleven trillion, one hundred eleven billion, two hundred twenty million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •