Base | Representation |
---|---|
bin | 1001001011111101100100… |
… | …1000100011011101000111 |
3 | 1022202122201210102210211221 |
4 | 2102333121020203131013 |
5 | 2310444033404324033 |
6 | 33252215240541211 |
7 | 2061531642636325 |
oct | 222773110433507 |
9 | 38678653383757 |
10 | 10101111011143 |
11 | 3244947915249 |
12 | 11717b5781807 |
13 | 5836b8ba27b9 |
14 | 26cc79956d15 |
15 | 127b4698b12d |
hex | 92fd9223747 |
10101111011143 has 2 divisors, whose sum is σ = 10101111011144. Its totient is φ = 10101111011142.
The previous prime is 10101111011011. The next prime is 10101111011153. The reversal of 10101111011143 is 34111011110101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10101111011143 - 29 = 10101111010631 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101111011153) 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 as a sum of consecutive naturals, namely, 5050555505571 + 5050555505572.
It is an arithmetic number, because the mean of its divisors is an integer number (5050555505572).
Almost surely, 210101111011143 is an apocalyptic number.
10101111011143 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101111011143 is an equidigital number, since it uses as much as digits as its factorization.
10101111011143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 10101111011143 its reverse (34111011110101), we get a palindrome (44212122121244).
The spelling of 10101111011143 in words is "ten trillion, one hundred one billion, one hundred eleven million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •