Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …100101100101111101111111 |
3 | 111020222001202211101210212221 |
4 | 112333030231211211331333 |
5 | 101222410300000310421 |
6 | 555004410540310211 |
7 | 30203143151021254 |
oct | 2677145545457577 |
9 | 436861684353787 |
10 | 101100000010111 |
11 | 2a2392a6374823 |
12 | b409a35542367 |
13 | 44548c5c259ab |
14 | 1ad73a22bd42b |
15 | ba4c9a273841 |
hex | 5bf32d965f7f |
101100000010111 has 2 divisors, whose sum is σ = 101100000010112. Its totient is φ = 101100000010110.
The previous prime is 101100000010099. The next prime is 101100000010123. The reversal of 101100000010111 is 111010000001101.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (101100000010099) and next prime (101100000010123).
It is a cyclic number.
It is not a de Polignac number, because 101100000010111 - 29 = 101100000009599 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100000010094 and 101100000010103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101100000010151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550000005055 + 50550000005056.
It is an arithmetic number, because the mean of its divisors is an integer number (50550000005056).
Almost surely, 2101100000010111 is an apocalyptic number.
101100000010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100000010111 is an equidigital number, since it uses as much as digits as its factorization.
101100000010111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101100000010111 its reverse (111010000001101), we get a palindrome (212110000011212).
The spelling of 101100000010111 in words is "one hundred one trillion, one hundred billion, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •