Base | Representation |
---|---|
bin | 1100001001001110000001… |
… | …0110010110101100000001 |
3 | 1202021111012020102110212001 |
4 | 3002103200112112230001 |
5 | 3222231431202444244 |
6 | 44222021501104001 |
7 | 2545454643665305 |
oct | 302234026265401 |
9 | 52244166373761 |
10 | 13352522312449 |
11 | 4288855822791 |
12 | 15b7984858001 |
13 | 75b1a2c98cc8 |
14 | 3423a0875d05 |
15 | 1824e2d725d4 |
hex | c24e0596b01 |
13352522312449 has 2 divisors, whose sum is σ = 13352522312450. Its totient is φ = 13352522312448.
The previous prime is 13352522312431. The next prime is 13352522312471. The reversal of 13352522312449 is 94421322525331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9558188423424 + 3794333889025 = 3091632^2 + 1947905^2 .
It is a cyclic number.
It is not a de Polignac number, because 13352522312449 - 229 = 13351985441537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13352522312399 and 13352522312408.
It is not a weakly prime, because it can be changed into another prime (13352522312149) 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, 6676261156224 + 6676261156225.
It is an arithmetic number, because the mean of its divisors is an integer number (6676261156225).
Almost surely, 213352522312449 is an apocalyptic number.
It is an amenable number.
13352522312449 is a deficient number, since it is larger than the sum of its proper divisors (1).
13352522312449 is an equidigital number, since it uses as much as digits as its factorization.
13352522312449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1555200, while the sum is 46.
The spelling of 13352522312449 in words is "thirteen trillion, three hundred fifty-two billion, five hundred twenty-two million, three hundred twelve thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •