Base | Representation |
---|---|
bin | 101111001011010100… |
… | …0000001101110001111 |
3 | 100200111120010110021002 |
4 | 1132112220001232033 |
5 | 3124441144314043 |
6 | 114313005130515 |
7 | 10214406015461 |
oct | 1362650015617 |
9 | 320446113232 |
10 | 101311323023 |
11 | 39a69667539 |
12 | 17774b59a3b |
13 | 97273b0521 |
14 | 4c9128c131 |
15 | 297e414bb8 |
hex | 1796a01b8f |
101311323023 has 2 divisors, whose sum is σ = 101311323024. Its totient is φ = 101311323022.
The previous prime is 101311322977. The next prime is 101311323067. The reversal of 101311323023 is 320323113101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101311323023 - 232 = 97016355727 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101311322986 and 101311323004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101311323823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50655661511 + 50655661512.
It is an arithmetic number, because the mean of its divisors is an integer number (50655661512).
Almost surely, 2101311323023 is an apocalyptic number.
101311323023 is a deficient number, since it is larger than the sum of its proper divisors (1).
101311323023 is an equidigital number, since it uses as much as digits as its factorization.
101311323023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101311323023 its reverse (320323113101), we get a palindrome (421634436124).
The spelling of 101311323023 in words is "one hundred one billion, three hundred eleven million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •