Base | Representation |
---|---|
bin | 1100000110110100000101… |
… | …0111110011101101011001 |
3 | 1202010112112102222100201112 |
4 | 3001231001113303231121 |
5 | 3221042314301113312 |
6 | 44151025301230105 |
7 | 2542462645423655 |
oct | 301550127635531 |
9 | 52115472870645 |
10 | 13311200410457 |
11 | 4272280678164 |
12 | 15ab972102335 |
13 | 7573190b0721 |
14 | 3403a08c5a65 |
15 | 1813c52c0d22 |
hex | c1b415f3b59 |
13311200410457 has 2 divisors, whose sum is σ = 13311200410458. Its totient is φ = 13311200410456.
The previous prime is 13311200410393. The next prime is 13311200410511. The reversal of 13311200410457 is 75401400211331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10553246027776 + 2757954382681 = 3248576^2 + 1660709^2 .
It is a cyclic number.
It is not a de Polignac number, because 13311200410457 - 26 = 13311200410393 is a prime.
It is not a weakly prime, because it can be changed into another prime (13311200410357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655600205228 + 6655600205229.
It is an arithmetic number, because the mean of its divisors is an integer number (6655600205229).
Almost surely, 213311200410457 is an apocalyptic number.
It is an amenable number.
13311200410457 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311200410457 is an equidigital number, since it uses as much as digits as its factorization.
13311200410457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 13311200410457 its reverse (75401400211331), we get a palindrome (88712600621788).
The spelling of 13311200410457 in words is "thirteen trillion, three hundred eleven billion, two hundred million, four hundred ten thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •