Base | Representation |
---|---|
bin | 10110111110000100001011… |
… | …000010111110110001101101 |
3 | 111020200121201121200012210212 |
4 | 112332010023002332301231 |
5 | 101220121240420200023 |
6 | 554504530034512205 |
7 | 30164415042142565 |
oct | 2676041302766155 |
9 | 436617647605725 |
10 | 101022111100013 |
11 | 2a209267090844 |
12 | b3b6918735665 |
13 | 444a4622926cc |
14 | 1ad36d3a79da5 |
15 | ba2c3c2ace78 |
hex | 5be10b0bec6d |
101022111100013 has 2 divisors, whose sum is σ = 101022111100014. Its totient is φ = 101022111100012.
The previous prime is 101022111099997. The next prime is 101022111100021. The reversal of 101022111100013 is 310001111220101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95302637962249 + 5719473137764 = 9762307^2 + 2391542^2 .
It is a cyclic number.
It is not a de Polignac number, because 101022111100013 - 24 = 101022111099997 is a prime.
It is a super-2 number, since 2×1010221111000132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101022111100213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50511055550006 + 50511055550007.
It is an arithmetic number, because the mean of its divisors is an integer number (50511055550007).
Almost surely, 2101022111100013 is an apocalyptic number.
It is an amenable number.
101022111100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101022111100013 is an equidigital number, since it uses as much as digits as its factorization.
101022111100013 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 14.
Adding to 101022111100013 its reverse (310001111220101), we get a palindrome (411023222320114).
The spelling of 101022111100013 in words is "one hundred one trillion, twenty-two billion, one hundred eleven million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •