Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101100100000001111110 |
3 | 10220011022121002110120000 |
4 | 100000131231210001332 |
5 | 121010310042023402 |
6 | 2201200534135130 |
7 | 142321163445660 |
oct | 20003555440176 |
9 | 3804277073500 |
10 | 1100010111102 |
11 | 39456a037681 |
12 | 1592331b14a6 |
13 | 7c965c08586 |
14 | 3b35297a530 |
15 | 1d9317ebc1c |
hex | 1001db6407e |
1100010111102 has 40 divisors (see below), whose sum is σ = 2816957112816. Its totient is φ = 314288602848.
The previous prime is 1100010111073. The next prime is 1100010111143. The reversal of 1100010111102 is 2011110100011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 485012143 + ... + 485014410.
Almost surely, 21100010111102 is an apocalyptic number.
1100010111102 is an abundant number, since it is smaller than the sum of its proper divisors (1716947001714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100010111102 is an equidigital number, since it uses as much as digits as its factorization.
1100010111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 970026574 (or 970026565 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1100010111102 its reverse (2011110100011), we get a palindrome (3111120211113).
The spelling of 1100010111102 in words is "one trillion, one hundred billion, ten million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •