Base | Representation |
---|---|
bin | 10011100101000011010… |
… | …000011000010100000101 |
3 | 11202121211221102202011221 |
4 | 103211003100120110011 |
5 | 134020442000143023 |
6 | 2510032002000341 |
7 | 166130403626335 |
oct | 23450320302405 |
9 | 4677757382157 |
10 | 1345453131013 |
11 | 479670242282 |
12 | 1989116460b1 |
13 | 99b4cb60434 |
14 | 4919808d0c5 |
15 | 24ee951e85d |
hex | 13943418505 |
1345453131013 has 2 divisors, whose sum is σ = 1345453131014. Its totient is φ = 1345453131012.
The previous prime is 1345453130969. The next prime is 1345453131017. The reversal of 1345453131013 is 3101313545431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 987713970244 + 357739160769 = 993838^2 + 598113^2 .
It is a cyclic number.
It is not a de Polignac number, because 1345453131013 - 29 = 1345453130501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1345453131013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1345453131017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 672726565506 + 672726565507.
It is an arithmetic number, because the mean of its divisors is an integer number (672726565507).
Almost surely, 21345453131013 is an apocalyptic number.
It is an amenable number.
1345453131013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345453131013 is an equidigital number, since it uses as much as digits as its factorization.
1345453131013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 1345453131013 its reverse (3101313545431), we get a palindrome (4446766676444).
The spelling of 1345453131013 in words is "one trillion, three hundred forty-five billion, four hundred fifty-three million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •