Base | Representation |
---|---|
bin | 1011111100110111111010… |
… | …1111010111011001111001 |
3 | 1201112012202020202221022111 |
4 | 2333031332233113121321 |
5 | 3210243100403214223 |
6 | 43540344130452321 |
7 | 2524236065112565 |
oct | 277157657273171 |
9 | 51465666687274 |
10 | 13140431304313 |
11 | 42069099a0185 |
12 | 1582853a340a1 |
13 | 7441a29cc561 |
14 | 336000a466a5 |
15 | 17bc2d1a230d |
hex | bf37ebd7679 |
13140431304313 has 2 divisors, whose sum is σ = 13140431304314. Its totient is φ = 13140431304312.
The previous prime is 13140431304281. The next prime is 13140431304323. The reversal of 13140431304313 is 31340313404131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13138827061504 + 1604242809 = 3624752^2 + 40053^2 .
It is a cyclic number.
It is not a de Polignac number, because 13140431304313 - 25 = 13140431304281 is a prime.
It is not a weakly prime, because it can be changed into another prime (13140431304323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6570215652156 + 6570215652157.
It is an arithmetic number, because the mean of its divisors is an integer number (6570215652157).
Almost surely, 213140431304313 is an apocalyptic number.
It is an amenable number.
13140431304313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13140431304313 is an equidigital number, since it uses as much as digits as its factorization.
13140431304313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 13140431304313 its reverse (31340313404131), we get a palindrome (44480744708444).
The spelling of 13140431304313 in words is "thirteen trillion, one hundred forty billion, four hundred thirty-one million, three hundred four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •