Base | Representation |
---|---|
bin | 1100000111100011110100… |
… | …1100110110110001001111 |
3 | 1202011202121112111211212022 |
4 | 3001320331030312301033 |
5 | 3221300040411114211 |
6 | 44200545041400355 |
7 | 2543425343443346 |
oct | 301707514666117 |
9 | 52152545454768 |
10 | 13324015332431 |
11 | 4277757331771 |
12 | 15b23499390bb |
13 | 7585ac0210ab |
14 | 340c58834b5d |
15 | 1818c5364bdb |
hex | c1e3d336c4f |
13324015332431 has 2 divisors, whose sum is σ = 13324015332432. Its totient is φ = 13324015332430.
The previous prime is 13324015332409. The next prime is 13324015332487. The reversal of 13324015332431 is 13423351042331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13324015332431 - 26 = 13324015332367 is a prime.
It is a super-2 number, since 2×133240153324312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 13324015332391 and 13324015332400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13324015332401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6662007666215 + 6662007666216.
It is an arithmetic number, because the mean of its divisors is an integer number (6662007666216).
Almost surely, 213324015332431 is an apocalyptic number.
13324015332431 is a deficient number, since it is larger than the sum of its proper divisors (1).
13324015332431 is an equidigital number, since it uses as much as digits as its factorization.
13324015332431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 13324015332431 its reverse (13423351042331), we get a palindrome (26747366374762).
The spelling of 13324015332431 in words is "thirteen trillion, three hundred twenty-four billion, fifteen million, three hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •