Base | Representation |
---|---|
bin | 1001000110001001000000… |
… | …0100101000110110101111 |
3 | 1022102002120220221212001021 |
4 | 2101202100010220312233 |
5 | 2302324223324000421 |
6 | 33134235315155011 |
7 | 2051361414604204 |
oct | 221422004506657 |
9 | 38362526855037 |
10 | 10001101000111 |
11 | 3206496871771 |
12 | 11563445a5a67 |
13 | 57713b299490 |
14 | 2680ad44bcab |
15 | 125241925341 |
hex | 91890128daf |
10001101000111 has 4 divisors (see below), whose sum is σ = 10770416461672. Its totient is φ = 9231785538552.
The previous prime is 10001101000109. The next prime is 10001101000181. The reversal of 10001101000111 is 11100010110001.
It is a happy number.
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 10001101000111 - 21 = 10001101000109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10001101000094 and 10001101000103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001101000181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 384657730761 + ... + 384657730786.
It is an arithmetic number, because the mean of its divisors is an integer number (2692604115418).
Almost surely, 210001101000111 is an apocalyptic number.
10001101000111 is a deficient number, since it is larger than the sum of its proper divisors (769315461561).
10001101000111 is an equidigital number, since it uses as much as digits as its factorization.
10001101000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 769315461560.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10001101000111 its reverse (11100010110001), we get a palindrome (21101111110112).
The spelling of 10001101000111 in words is "ten trillion, one billion, one hundred one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •