Base | Representation |
---|---|
bin | 10011000110110101100… |
… | …000000111110110010011 |
3 | 11122112002221012010122101 |
4 | 103012311200013312103 |
5 | 133003021042402011 |
6 | 2443104415421231 |
7 | 163601420614531 |
oct | 23066540076623 |
9 | 4575087163571 |
10 | 1313010122131 |
11 | 466931a90544 |
12 | 192578524817 |
13 | 96a7c601466 |
14 | 4779b3cb151 |
15 | 2424b1c62c1 |
hex | 131b5807d93 |
1313010122131 has 2 divisors, whose sum is σ = 1313010122132. Its totient is φ = 1313010122130.
The previous prime is 1313010122113. The next prime is 1313010122279. The reversal of 1313010122131 is 1312210103131.
Together with previous prime (1313010122113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1313010122131 - 223 = 1313001733523 is a prime.
It is a super-2 number, since 2×13130101221312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1313010122099 and 1313010122108.
It is not a weakly prime, because it can be changed into another prime (1313010122731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656505061065 + 656505061066.
It is an arithmetic number, because the mean of its divisors is an integer number (656505061066).
Almost surely, 21313010122131 is an apocalyptic number.
1313010122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313010122131 is an equidigital number, since it uses as much as digits as its factorization.
1313010122131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1313010122131 its reverse (1312210103131), we get a palindrome (2625220225262).
The spelling of 1313010122131 in words is "one trillion, three hundred thirteen billion, ten million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •