Base | Representation |
---|---|
bin | 101110100100110111… |
… | …0010000100100111101 |
3 | 100120011122100220020100 |
4 | 1131021232100210331 |
5 | 3114320401023401 |
6 | 113540555311313 |
7 | 10140421262622 |
oct | 1351156204475 |
9 | 316148326210 |
10 | 100021111101 |
11 | 3946734519a |
12 | 17474a4b539 |
13 | 957ccc1812 |
14 | 4babb98349 |
15 | 2906009b86 |
hex | 1749b9093d |
100021111101 has 48 divisors (see below), whose sum is σ = 150332598000. Its totient is φ = 64027459584.
The previous prime is 100021111097. The next prime is 100021111129. The reversal of 100021111101 is 101111120001.
It can be written as a sum of positive squares in 8 ways, for example, as 10506455001 + 89514656100 = 102501^2 + 299190^2 .
It is not a de Polignac number, because 100021111101 - 22 = 100021111097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100021118101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 17097625 + ... + 17103473.
It is an arithmetic number, because the mean of its divisors is an integer number (3131929125).
Almost surely, 2100021111101 is an apocalyptic number.
It is an amenable number.
100021111101 is a deficient number, since it is larger than the sum of its proper divisors (50311486899).
100021111101 is a wasteful number, since it uses less digits than its factorization.
100021111101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6558 (or 6555 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100021111101 its reverse (101111120001), we get a palindrome (201132231102).
The spelling of 100021111101 in words is "one hundred billion, twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •