Base | Representation |
---|---|
bin | 101111001011010011… |
… | …1001011100111100101 |
3 | 100200111112201012021022 |
4 | 1132112213023213211 |
5 | 3124441120221123 |
6 | 114313000300525 |
7 | 10214404103414 |
oct | 1362647134745 |
9 | 320445635238 |
10 | 101311101413 |
11 | 39a69525a95 |
12 | 17774a71745 |
13 | 97273336b2 |
14 | 4c9123147b |
15 | 297e3be1c8 |
hex | 17969cb9e5 |
101311101413 has 2 divisors, whose sum is σ = 101311101414. Its totient is φ = 101311101412.
The previous prime is 101311101379. The next prime is 101311101439. The reversal of 101311101413 is 314101113101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52621148449 + 48689952964 = 229393^2 + 220658^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101311101413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101311101391 and 101311101400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101311104413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50655550706 + 50655550707.
It is an arithmetic number, because the mean of its divisors is an integer number (50655550707).
Almost surely, 2101311101413 is an apocalyptic number.
It is an amenable number.
101311101413 is a deficient number, since it is larger than the sum of its proper divisors (1).
101311101413 is an equidigital number, since it uses as much as digits as its factorization.
101311101413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 101311101413 its reverse (314101113101), we get a palindrome (415412214514).
The spelling of 101311101413 in words is "one hundred one billion, three hundred eleven million, one hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •