Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01000101000011001101 |
3 | 10112121110110110220011220 |
4 | 32203123101011003031 |
5 | 112341211420200414 |
6 | 2043240015433553 |
7 | 132153454042032 |
oct | 16433321050315 |
9 | 3477413426156 |
10 | 1000111100109 |
11 | 356165709070 |
12 | 1419b32258b9 |
13 | 734052c7854 |
14 | 365970c7389 |
15 | 1b0363aeca9 |
hex | e8db4450cd |
1000111100109 has 32 divisors (see below), whose sum is σ = 1457820702720. Its totient is φ = 604831920000.
The previous prime is 1000111100057. The next prime is 1000111100171. The reversal of 1000111100109 is 9010011110001.
It is not a de Polignac number, because 1000111100109 - 232 = 995816132813 is a prime.
It is a super-2 number, since 2×10001111001092 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000111100179) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31929634 + ... + 31960940.
It is an arithmetic number, because the mean of its divisors is an integer number (45556896960).
Almost surely, 21000111100109 is an apocalyptic number.
It is an amenable number.
1000111100109 is a deficient number, since it is larger than the sum of its proper divisors (457709602611).
1000111100109 is a wasteful number, since it uses less digits than its factorization.
1000111100109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33361.
The product of its (nonzero) digits is 9, while the sum is 15.
The spelling of 1000111100109 in words is "one trillion, one hundred eleven million, one hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •