Base | Representation |
---|---|
bin | 11101001000100000011… |
… | …11111101101001101111 |
3 | 10112200202102002200202012 |
4 | 32210100033331221233 |
5 | 112400022000000421 |
6 | 2043504131551435 |
7 | 132214466420156 |
oct | 16442017755157 |
9 | 3480672080665 |
10 | 1001000000111 |
11 | 356581449871 |
12 | 142000a5b57b |
13 | 73517505a97 |
14 | 3663d19459d |
15 | 1b08944795b |
hex | e9103fda6f |
1001000000111 has 4 divisors (see below), whose sum is σ = 1002966601800. Its totient is φ = 999033398424.
The previous prime is 1001000000093. The next prime is 1001000000177. The reversal of 1001000000111 is 1110000001001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1001000000111 - 218 = 1000999737967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1001000000095 and 1001000000104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001000030111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 983300081 + ... + 983301098.
It is an arithmetic number, because the mean of its divisors is an integer number (250741650450).
Almost surely, 21001000000111 is an apocalyptic number.
1001000000111 is a deficient number, since it is larger than the sum of its proper divisors (1966601689).
1001000000111 is an equidigital number, since it uses as much as digits as its factorization.
1001000000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1966601688.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 1001000000111 its reverse (1110000001001), we get a palindrome (2111000001112).
The spelling of 1001000000111 in words is "one trillion, one billion, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •