Base | Representation |
---|---|
bin | 101111001011010011… |
… | …0110111110001001111 |
3 | 100200111112120001202010 |
4 | 1132112212313301033 |
5 | 3124441110120421 |
6 | 114312554432303 |
7 | 10214403314400 |
oct | 1362646676117 |
9 | 320445501663 |
10 | 101311020111 |
11 | 39a6947a9a4 |
12 | 17774a32693 |
13 | 97273056a2 |
14 | 4c9120d9a7 |
15 | 297e3a5076 |
hex | 17969b7c4f |
101311020111 has 24 divisors (see below), whose sum is σ = 158661070464. Its totient is φ = 57329944560.
The previous prime is 101311020101. The next prime is 101311020119. The reversal of 101311020111 is 111020113101.
It is not a de Polignac number, because 101311020111 - 27 = 101311019983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101311020119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3330445 + ... + 3360726.
It is an arithmetic number, because the mean of its divisors is an integer number (6610877936).
Almost surely, 2101311020111 is an apocalyptic number.
101311020111 is a deficient number, since it is larger than the sum of its proper divisors (57350050353).
101311020111 is a wasteful number, since it uses less digits than its factorization.
101311020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6691291 (or 6691284 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 101311020111 its reverse (111020113101), we get a palindrome (212331133212).
The spelling of 101311020111 in words is "one hundred one billion, three hundred eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •