Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0100110000111011011111 |
3 | 1022202112220010210001021200 |
4 | 2102332113210300323133 |
5 | 2310434310321010421 |
6 | 33251514150130543 |
7 | 2061462455634636 |
oct | 222762744607337 |
9 | 38675803701250 |
10 | 10100011110111 |
11 | 3244432a6832a |
12 | 1171549350a53 |
13 | 583572057ba0 |
14 | 26cbb384251d |
15 | 127ad0124726 |
hex | 92f97930edf |
10100011110111 has 12 divisors (see below), whose sum is σ = 15711128393688. Its totient is φ = 6215391452304.
The previous prime is 10100011110089. The next prime is 10100011110127. The reversal of 10100011110111 is 11101111000101.
It is not a de Polignac number, because 10100011110111 - 210 = 10100011109087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10100011110093 and 10100011110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100011110611) 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, 43162440525 + ... + 43162440758.
It is an arithmetic number, because the mean of its divisors is an integer number (1309260699474).
Almost surely, 210100011110111 is an apocalyptic number.
10100011110111 is a deficient number, since it is larger than the sum of its proper divisors (5611117283577).
10100011110111 is a wasteful number, since it uses less digits than its factorization.
10100011110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86324881302 (or 86324881299 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 10100011110111 its reverse (11101111000101), we get a palindrome (21201122110212).
The spelling of 10100011110111 in words is "ten trillion, one hundred billion, eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •