Base | Representation |
---|---|
bin | 10110000001100100010… |
… | …110001010100100000111 |
3 | 12100200122020212212220022 |
4 | 112001210112022210013 |
5 | 144244133034121411 |
6 | 3115144155125355 |
7 | 214230144622361 |
oct | 26014426124407 |
9 | 5320566785808 |
10 | 1513512020231 |
11 | 533971095162 |
12 | 2053b414385b |
13 | ac9538bb653 |
14 | 5337bdd9d31 |
15 | 2958373aedb |
hex | 1606458a907 |
1513512020231 has 2 divisors, whose sum is σ = 1513512020232. Its totient is φ = 1513512020230.
The previous prime is 1513512020173. The next prime is 1513512020233. The reversal of 1513512020231 is 1320202153151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1513512020231 - 222 = 1513507825927 is a prime.
It is a super-2 number, since 2×15135120202312 (a number of 25 digits) contains 22 as substring.
Together with 1513512020233, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1513512020231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1513512020233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 756756010115 + 756756010116.
It is an arithmetic number, because the mean of its divisors is an integer number (756756010116).
Almost surely, 21513512020231 is an apocalyptic number.
1513512020231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1513512020231 is an equidigital number, since it uses as much as digits as its factorization.
1513512020231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 1513512020231 its reverse (1320202153151), we get a palindrome (2833714173382).
The spelling of 1513512020231 in words is "one trillion, five hundred thirteen billion, five hundred twelve million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •