Base | Representation |
---|---|
bin | 1100001101110010110110… |
… | …0100011110000001101111 |
3 | 1202120000002100112000200011 |
4 | 3003130231210132001233 |
5 | 3230023422040110422 |
6 | 44322101422114051 |
7 | 2554236566051254 |
oct | 303345544360157 |
9 | 52500070460604 |
10 | 13431127269487 |
11 | 43091222163a4 |
12 | 160b06141b927 |
13 | 76571c0996c5 |
14 | 3460da22d42b |
15 | 184593b2a077 |
hex | c372d91e06f |
13431127269487 has 2 divisors, whose sum is σ = 13431127269488. Its totient is φ = 13431127269486.
The previous prime is 13431127269479. The next prime is 13431127269493. The reversal of 13431127269487 is 78496272113431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13431127269487 - 23 = 13431127269479 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13431127263487) 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, 6715563634743 + 6715563634744.
It is an arithmetic number, because the mean of its divisors is an integer number (6715563634744).
Almost surely, 213431127269487 is an apocalyptic number.
13431127269487 is a deficient number, since it is larger than the sum of its proper divisors (1).
13431127269487 is an equidigital number, since it uses as much as digits as its factorization.
13431127269487 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12192768, while the sum is 58.
The spelling of 13431127269487 in words is "thirteen trillion, four hundred thirty-one billion, one hundred twenty-seven million, two hundred sixty-nine thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.084 sec. • engine limits •