Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …001001100010000101011111 |
3 | 111020121111220200222212202200 |
4 | 112331233223021202011133 |
5 | 101214241201341010421 |
6 | 554450450024222543 |
7 | 30163005442256040 |
oct | 2675575311420537 |
9 | 436544820885680 |
10 | 101000101110111 |
11 | 2a1aa9a2011645 |
12 | b3b25b560aa53 |
13 | 4448365353648 |
14 | 1ad26068588c7 |
15 | ba239ed59726 |
hex | 5bdbeb26215f |
101000101110111 has 48 divisors (see below), whose sum is σ = 175905391833600. Its totient is φ = 54552197784384.
The previous prime is 101000101110053. The next prime is 101000101110113. The reversal of 101000101110111 is 111011101000101.
It is not a de Polignac number, because 101000101110111 - 211 = 101000101108063 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 = 101000101110093 and 101000101110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000101110113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 95576676 + ... + 96627641.
It is an arithmetic number, because the mean of its divisors is an integer number (3664695663200).
Almost surely, 2101000101110111 is an apocalyptic number.
101000101110111 is a deficient number, since it is larger than the sum of its proper divisors (74905290723489).
101000101110111 is a wasteful number, since it uses less digits than its factorization.
101000101110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192204788 (or 192204785 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101000101110111 its reverse (111011101000101), we get a palindrome (212011202110212).
The spelling of 101000101110111 in words is "one hundred one trillion, one hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •