Base | Representation |
---|---|
bin | 10110110000110010101101… |
… | …101001101001001000111101 |
3 | 111010110102102210121221122101 |
4 | 112300302231221221020331 |
5 | 101110200300321004244 |
6 | 552525523150345101 |
7 | 30041465254144231 |
oct | 2660625551511075 |
9 | 433412383557571 |
10 | 100110011109949 |
11 | 29997465455365 |
12 | b289ba81bb191 |
13 | 43b2444a32989 |
14 | 1aa14c96885c1 |
15 | b8915785e0d4 |
hex | 5b0cada6923d |
100110011109949 has 2 divisors, whose sum is σ = 100110011109950. Its totient is φ = 100110011109948.
The previous prime is 100110011109947. The next prime is 100110011110049. The reversal of 100110011109949 is 949901110011001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82003981916025 + 18106029193924 = 9055605^2 + 4255118^2 .
It is a cyclic number.
It is not a de Polignac number, because 100110011109949 - 21 = 100110011109947 is a prime.
It is a super-2 number, since 2×1001100111099492 (a number of 29 digits) contains 22 as substring.
Together with 100110011109947, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100110011109947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055005554974 + 50055005554975.
It is an arithmetic number, because the mean of its divisors is an integer number (50055005554975).
Almost surely, 2100110011109949 is an apocalyptic number.
It is an amenable number.
100110011109949 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110011109949 is an equidigital number, since it uses as much as digits as its factorization.
100110011109949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 100110011109949 in words is "one hundred trillion, one hundred ten billion, eleven million, one hundred nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •