Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1101001010111000000001 |
3 | 1110022011120212121110121020 |
4 | 2201201320031022320001 |
5 | 2423331213311224301 |
6 | 35335211143020053 |
7 | 2223651415005351 |
oct | 241417015127001 |
9 | 43264525543536 |
10 | 11100212211201 |
11 | 359a634458473 |
12 | 12b336673a629 |
13 | 62698cba4c49 |
14 | 2a5378876b61 |
15 | 143b1e361436 |
hex | a187834ae01 |
11100212211201 has 32 divisors (see below), whose sum is σ = 14876666880000. Its totient is φ = 7362057351168.
The previous prime is 11100212211133. The next prime is 11100212211227. The reversal of 11100212211201 is 10211221200111.
It is a happy number.
It is not a de Polignac number, because 11100212211201 - 211 = 11100212209153 is a prime.
It is a super-2 number, since 2×111002122112012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11100212211401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1115706375 + ... + 1115716323.
It is an arithmetic number, because the mean of its divisors is an integer number (464895840000).
Almost surely, 211100212211201 is an apocalyptic number.
It is an amenable number.
11100212211201 is a deficient number, since it is larger than the sum of its proper divisors (3776454668799).
11100212211201 is a wasteful number, since it uses less digits than its factorization.
11100212211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12473.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11100212211201 its reverse (10211221200111), we get a palindrome (21311433411312).
The spelling of 11100212211201 in words is "eleven trillion, one hundred billion, two hundred twelve million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •