Base | Representation |
---|---|
bin | 101110100101110000… |
… | …0010011011010000111 |
3 | 100120020201121202211222 |
4 | 1131023200103122013 |
5 | 3114401024211421 |
6 | 113543544150555 |
7 | 10141233346166 |
oct | 1351340233207 |
9 | 316221552758 |
10 | 100051007111 |
11 | 39482204540 |
12 | 17482a6845b |
13 | 958625b373 |
14 | 4bb1b3b3dd |
15 | 2908962cab |
hex | 174b813687 |
100051007111 has 8 divisors (see below), whose sum is σ = 109148860800. Its totient is φ = 90953538040.
The previous prime is 100051007053. The next prime is 100051007113. The reversal of 100051007111 is 111700150001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100051007111 - 26 = 100051007047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100051007111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100051007113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 869150 + ... + 977508.
It is an arithmetic number, because the mean of its divisors is an integer number (13643607600).
Almost surely, 2100051007111 is an apocalyptic number.
100051007111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100051007111 is a deficient number, since it is larger than the sum of its proper divisors (9097853689).
100051007111 is a wasteful number, since it uses less digits than its factorization.
100051007111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192309.
The product of its (nonzero) digits is 35, while the sum is 17.
Adding to 100051007111 its reverse (111700150001), we get a palindrome (211751157112).
The spelling of 100051007111 in words is "one hundred billion, fifty-one million, seven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •