Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …101001101001001001101111 |
3 | 111010110102102210121221201020 |
4 | 112300302231221221021233 |
5 | 101110200300321004444 |
6 | 552525523150345223 |
7 | 30041465254144332 |
oct | 2660625551511157 |
9 | 433412383557636 |
10 | 100110011109999 |
11 | 29997465455400 |
12 | b289ba81bb213 |
13 | 43b2444a329c7 |
14 | 1aa14c9688619 |
15 | b8915785e119 |
hex | 5b0cada6926f |
100110011109999 has 24 divisors (see below), whose sum is σ = 146718514440960. Its totient is φ = 60672398130960.
The previous prime is 100110011109949. The next prime is 100110011110049. The reversal of 100110011109999 is 999901110011001.
It is an interprime number because it is at equal distance from previous prime (100110011109949) and next prime (100110011110049).
It is not a de Polignac number, because 100110011109999 - 220 = 100110010061423 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100110011109999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110011109919) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 75334282 + ... + 76651640.
It is an arithmetic number, because the mean of its divisors is an integer number (6113271435040).
Almost surely, 2100110011109999 is an apocalyptic number.
100110011109999 is a deficient number, since it is larger than the sum of its proper divisors (46608503330961).
100110011109999 is a wasteful number, since it uses less digits than its factorization.
100110011109999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1526731 (or 1526720 counting only the distinct ones).
The product of its (nonzero) digits is 6561, while the sum is 42.
The spelling of 100110011109999 in words is "one hundred trillion, one hundred ten billion, eleven million, one hundred nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •