Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1110100111110001000111 |
3 | 1022202112212102222001020100 |
4 | 2102332112332213301013 |
5 | 2310434300241023421 |
6 | 33251513151535143 |
7 | 2061462304641222 |
oct | 222762676476107 |
9 | 38675772861210 |
10 | 10100001111111 |
11 | 324442835899a |
12 | 1171545b2a4b3 |
13 | 58356cc66912 |
14 | 26cbb239c5b9 |
15 | 127ace2ebc26 |
hex | 92f96fa7c47 |
10100001111111 has 12 divisors (see below), whose sum is σ = 14983184831992. Its totient is φ = 6551352071856.
The previous prime is 10100001111077. The next prime is 10100001111133. The reversal of 10100001111111 is 11111110000101.
It is not a de Polignac number, because 10100001111111 - 221 = 10099999013959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
10100001111111 is a modest number, since divided by 1111111 gives 1010000 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 10100001111093 and 10100001111102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100000111111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15165166501 + ... + 15165167166.
Almost surely, 210100001111111 is an apocalyptic number.
10100001111111 is a deficient number, since it is larger than the sum of its proper divisors (4883183720881).
10100001111111 is a wasteful number, since it uses less digits than its factorization.
10100001111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30330333710 (or 30330333707 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10100001111111 its reverse (11111110000101), we get a palindrome (21211111111212).
The spelling of 10100001111111 in words is "ten trillion, one hundred billion, one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •