Base | Representation |
---|---|
bin | 1100001000000001111100… |
… | …1101001000100001011001 |
3 | 1202012112111010001022012221 |
4 | 3002000133031020201121 |
5 | 3221413121104221012 |
6 | 44204403315304041 |
7 | 2544132626254423 |
oct | 302003715104131 |
9 | 52175433038187 |
10 | 13332102023257 |
11 | 4280127030226 |
12 | 15b3a25bab021 |
13 | 75929a4c7b54 |
14 | 3413c4827813 |
15 | 181bea286507 |
hex | c201f348859 |
13332102023257 has 2 divisors, whose sum is σ = 13332102023258. Its totient is φ = 13332102023256.
The previous prime is 13332102023213. The next prime is 13332102023269. The reversal of 13332102023257 is 75232020123331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7704821371536 + 5627280651721 = 2775756^2 + 2372189^2 .
It is a cyclic number.
It is not a de Polignac number, because 13332102023257 - 27 = 13332102023129 is a prime.
It is not a weakly prime, because it can be changed into another prime (13332102023557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6666051011628 + 6666051011629.
It is an arithmetic number, because the mean of its divisors is an integer number (6666051011629).
Almost surely, 213332102023257 is an apocalyptic number.
It is an amenable number.
13332102023257 is a deficient number, since it is larger than the sum of its proper divisors (1).
13332102023257 is an equidigital number, since it uses as much as digits as its factorization.
13332102023257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 34.
Adding to 13332102023257 its reverse (75232020123331), we get a palindrome (88564122146588).
The spelling of 13332102023257 in words is "thirteen trillion, three hundred thirty-two billion, one hundred two million, twenty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •