Base | Representation |
---|---|
bin | 1100011010000110100001… |
… | …0000101101000010000001 |
3 | 1210022012211211112221222102 |
4 | 3012201220100231002001 |
5 | 3242004433211410223 |
6 | 45003150305520145 |
7 | 2605433326030406 |
oct | 306415020550201 |
9 | 53265754487872 |
10 | 13642565341313 |
11 | 438a863524217 |
12 | 164402b643055 |
13 | 77c646cc47cc |
14 | 3524374562ad |
15 | 189d1b322928 |
hex | c686842d081 |
13642565341313 has 2 divisors, whose sum is σ = 13642565341314. Its totient is φ = 13642565341312.
The previous prime is 13642565341291. The next prime is 13642565341331. The reversal of 13642565341313 is 31314356524631.
Together with next prime (13642565341331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10972570125169 + 2669995216144 = 3312487^2 + 1634012^2 .
It is a cyclic number.
It is not a de Polignac number, because 13642565341313 - 216 = 13642565275777 is a prime.
It is a super-2 number, since 2×136425653413132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13642565341393) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6821282670656 + 6821282670657.
It is an arithmetic number, because the mean of its divisors is an integer number (6821282670657).
Almost surely, 213642565341313 is an apocalyptic number.
It is an amenable number.
13642565341313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13642565341313 is an equidigital number, since it uses as much as digits as its factorization.
13642565341313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2332800, while the sum is 47.
The spelling of 13642565341313 in words is "thirteen trillion, six hundred forty-two billion, five hundred sixty-five million, three hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •