Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100001101000100111110111 |
3 | 111010210001021121202111202010 |
4 | 112302012232201220213313 |
5 | 101113140022321213421 |
6 | 553035202354215303 |
7 | 30051140602003404 |
oct | 2662065641504767 |
9 | 433701247674663 |
10 | 100200220101111 |
11 | 29a2174703a619 |
12 | b2a3582b84533 |
13 | 43baabcc39860 |
14 | 1aa5a062292ab |
15 | b8b68721e076 |
hex | 5b21ae8689f7 |
100200220101111 has 64 divisors (see below), whose sum is σ = 155224108892160. Its totient is φ = 56936168540160.
The previous prime is 100200220101073. The next prime is 100200220101151. The reversal of 100200220101111 is 111101022002001.
It is not a de Polignac number, because 100200220101111 - 215 = 100200220068343 is a prime.
It is a super-2 number, since 2×1002002201011112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100200220101151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 672450826 + ... + 672599816.
It is an arithmetic number, because the mean of its divisors is an integer number (2425376701440).
Almost surely, 2100200220101111 is an apocalyptic number.
100200220101111 is a deficient number, since it is larger than the sum of its proper divisors (55023888791049).
100200220101111 is a wasteful number, since it uses less digits than its factorization.
100200220101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168216.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100200220101111 its reverse (111101022002001), we get a palindrome (211301242103112).
The spelling of 100200220101111 in words is "one hundred trillion, two hundred billion, two hundred twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •