Base | Representation |
---|---|
bin | 10010111011101011011… |
… | …111110101000110001101 |
3 | 11121101012002120102111021 |
4 | 102323223133311012031 |
5 | 132304002431104401 |
6 | 2433404015554141 |
7 | 162665522665126 |
oct | 22735337650615 |
9 | 4541162512437 |
10 | 1301031113101 |
11 | 461845166785 |
12 | 19019482b951 |
13 | 958c0909135 |
14 | 46d824b504d |
15 | 23c997002a1 |
hex | 12eeb7f518d |
1301031113101 has 2 divisors, whose sum is σ = 1301031113102. Its totient is φ = 1301031113100.
The previous prime is 1301031113089. The next prime is 1301031113111. The reversal of 1301031113101 is 1013111301031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 729572222500 + 571458890601 = 854150^2 + 755949^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301031113101 - 237 = 1163592159629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301031113111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650515556550 + 650515556551.
It is an arithmetic number, because the mean of its divisors is an integer number (650515556551).
Almost surely, 21301031113101 is an apocalyptic number.
It is an amenable number.
1301031113101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301031113101 is an equidigital number, since it uses as much as digits as its factorization.
1301031113101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1301031113101 its reverse (1013111301031), we get a palindrome (2314142414132).
The spelling of 1301031113101 in words is "one trillion, three hundred one billion, thirty-one million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •