Base | Representation |
---|---|
bin | 101110101010110010… |
… | …0111111111001111111 |
3 | 100120200111122000101100 |
4 | 1131111210333321333 |
5 | 3120222310310421 |
6 | 114012422344143 |
7 | 10145355013254 |
oct | 1352544777177 |
9 | 316614560340 |
10 | 100220010111 |
11 | 39559645a41 |
12 | 1750b58b053 |
13 | 95b2281940 |
14 | 4bca37142b |
15 | 29186e7c26 |
hex | 175593fe7f |
100220010111 has 48 divisors (see below), whose sum is σ = 158948479872. Its totient is φ = 60468595200.
The previous prime is 100220010109. The next prime is 100220010133. The reversal of 100220010111 is 111010022001.
It is a happy number.
It is not a de Polignac number, because 100220010111 - 21 = 100220010109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100220010093 and 100220010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100220010211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10667226 + ... + 10676616.
It is an arithmetic number, because the mean of its divisors is an integer number (3311426664).
Almost surely, 2100220010111 is an apocalyptic number.
100220010111 is a deficient number, since it is larger than the sum of its proper divisors (58728469761).
100220010111 is a wasteful number, since it uses less digits than its factorization.
100220010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11184 (or 11181 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100220010111 its reverse (111010022001), we get a palindrome (211230032112).
It can be divided in two parts, 100220010 and 111, that added together give a square (100220121 = 100112).
The spelling of 100220010111 in words is "one hundred billion, two hundred twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •