Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001100000100010000111110 |
3 | 111020121111122201211101220200 |
4 | 112331233211030010100332 |
5 | 101214241000241023402 |
6 | 554450432053024330 |
7 | 30163003116266532 |
oct | 2675574514042076 |
9 | 436544581741820 |
10 | 101000001111102 |
11 | 2a1aa950620935 |
12 | b3b25880250a6 |
13 | 444834a710432 |
14 | 1ad25d7467bc2 |
15 | ba23961a521c |
hex | 5bdbe530443e |
101000001111102 has 12 divisors (see below), whose sum is σ = 218833335740760. Its totient is φ = 33666667037028.
The previous prime is 101000001111017. The next prime is 101000001111131. The reversal of 101000001111102 is 201111100000101.
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 polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2805555586402 + ... + 2805555586437.
It is an arithmetic number, because the mean of its divisors is an integer number (18236111311730).
Almost surely, 2101000001111102 is an apocalyptic number.
101000001111102 is an abundant number, since it is smaller than the sum of its proper divisors (117833334629658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000001111102 is a wasteful number, since it uses less digits than its factorization.
101000001111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5611111172847 (or 5611111172844 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101000001111102 its reverse (201111100000101), we get a palindrome (302111101111203).
The spelling of 101000001111102 in words is "one hundred one trillion, one million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •