Base | Representation |
---|---|
bin | 10110110000101001100110… |
… | …000100010100101110111111 |
3 | 111010102111011110022201000110 |
4 | 112300221212010110232333 |
5 | 101110020222333210421 |
6 | 552521223433401103 |
7 | 30041000525650602 |
oct | 2660514604245677 |
9 | 433374143281013 |
10 | 100100220210111 |
11 | 299932a0779400 |
12 | b288115269193 |
13 | 43b1544467914 |
14 | 1aa0c3b1d6339 |
15 | b88c83006a76 |
hex | 5b0a66114bbf |
100100220210111 has 24 divisors (see below), whose sum is σ = 146708272630192. Its totient is φ = 60664765708800.
The previous prime is 100100220210083. The next prime is 100100220210119. The reversal of 100100220210111 is 111012022001001.
It is not a de Polignac number, because 100100220210111 - 26 = 100100220210047 is a prime.
It is a super-2 number, since 2×1001002202101112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100100220210119) 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, 6251151 + ... + 15468591.
Almost surely, 2100100220210111 is an apocalyptic number.
100100220210111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100100220210111 is a deficient number, since it is larger than the sum of its proper divisors (46608052420081).
100100220210111 is a wasteful number, since it uses less digits than its factorization.
100100220210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9247383 (or 9247372 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100100220210111 its reverse (111012022001001), we get a palindrome (211112242211112).
The spelling of 100100220210111 in words is "one hundred trillion, one hundred billion, two hundred twenty million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •