Base | Representation |
---|---|
bin | 101110100100001110… |
… | …1110001001101011110 |
3 | 100120010011122220110220 |
4 | 1131020131301031132 |
5 | 3114300000323402 |
6 | 113534523142210 |
7 | 10140044032605 |
oct | 1351035611536 |
9 | 316104586426 |
10 | 100000011102 |
11 | 39456443482 |
12 | 17469974966 |
13 | 9578814804 |
14 | 4ba9064a3c |
15 | 290423cdbc |
hex | 174877135e |
100000011102 has 8 divisors (see below), whose sum is σ = 200000022216. Its totient is φ = 33333337032.
The previous prime is 100000011073. The next prime is 100000011103. The reversal of 100000011102 is 201110000001.
It is a sphenic number, since it is the product of 3 distinct primes.
100000011102 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (6), and also a Moran number because the ratio is a prime number: 16666668517 = 100000011102 / (1 + 0 + 0 + 0 + 0 + 0 + 0 + 1 + 1 + 1 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000011103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8333334253 + ... + 8333334264.
It is an arithmetic number, because the mean of its divisors is an integer number (25000002777).
Almost surely, 2100000011102 is an apocalyptic number.
100000011102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000011102 is a wasteful number, since it uses less digits than its factorization.
100000011102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16666668522.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 100000011102 its reverse (201110000001), we get a palindrome (301110011103).
The spelling of 100000011102 in words is "one hundred billion, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •