Base | Representation |
---|---|
bin | 101111001000111010… |
… | …1101101001110100101 |
3 | 100200021222000210100122 |
4 | 1132101311231032211 |
5 | 3124310120214023 |
6 | 114301020051325 |
7 | 10212412332611 |
oct | 1362165551645 |
9 | 320258023318 |
10 | 101231023013 |
11 | 39a2830099a |
12 | 17752093b45 |
13 | 9713876723 |
14 | 4c84748341 |
15 | 29773522c8 |
hex | 1791d6d3a5 |
101231023013 has 2 divisors, whose sum is σ = 101231023014. Its totient is φ = 101231023012.
The previous prime is 101231022983. The next prime is 101231023043. The reversal of 101231023013 is 310320132101.
It is a balanced prime because it is at equal distance from previous prime (101231022983) and next prime (101231023043).
It can be written as a sum of positive squares in only one way, i.e., 101204788129 + 26234884 = 318127^2 + 5122^2 .
It is a cyclic number.
It is not a de Polignac number, because 101231023013 - 210 = 101231021989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101231022982 and 101231023000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101231023043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50615511506 + 50615511507.
It is an arithmetic number, because the mean of its divisors is an integer number (50615511507).
Almost surely, 2101231023013 is an apocalyptic number.
It is an amenable number.
101231023013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101231023013 is an equidigital number, since it uses as much as digits as its factorization.
101231023013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101231023013 its reverse (310320132101), we get a palindrome (411551155114).
The spelling of 101231023013 in words is "one hundred one billion, two hundred thirty-one million, twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •