Base | Representation |
---|---|
bin | 1100001001001110000001… |
… | …0110010110101011101111 |
3 | 1202021111012020102110211101 |
4 | 3002103200112112223233 |
5 | 3222231431202444211 |
6 | 44222021501103531 |
7 | 2545454643665251 |
oct | 302234026265357 |
9 | 52244166373741 |
10 | 13352522312431 |
11 | 4288855822775 |
12 | 15b7984857ba7 |
13 | 75b1a2c98cb3 |
14 | 3423a0875cd1 |
15 | 1824e2d725c1 |
hex | c24e0596aef |
13352522312431 has 2 divisors, whose sum is σ = 13352522312432. Its totient is φ = 13352522312430.
The previous prime is 13352522312387. The next prime is 13352522312449. The reversal of 13352522312431 is 13421322525331.
13352522312431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13352522312431 - 217 = 13352522181359 is a prime.
It is a super-2 number, since 2×133525223124312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13352522312471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6676261156215 + 6676261156216.
It is an arithmetic number, because the mean of its divisors is an integer number (6676261156216).
Almost surely, 213352522312431 is an apocalyptic number.
13352522312431 is a deficient number, since it is larger than the sum of its proper divisors (1).
13352522312431 is an equidigital number, since it uses as much as digits as its factorization.
13352522312431 is an evil number, because the sum of its binary digits is even.
The product of its digits is 129600, while the sum is 37.
Adding to 13352522312431 its reverse (13421322525331), we get a palindrome (26773844837762).
The spelling of 13352522312431 in words is "thirteen trillion, three hundred fifty-two billion, five hundred twenty-two million, three hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.820 sec. • engine limits •