Base | Representation |
---|---|
bin | 1100001110100000100101… |
… | …0001011011101011001101 |
3 | 1202121011202212211222012202 |
4 | 3003220021101123223031 |
5 | 3230224042204414404 |
6 | 44331451510011245 |
7 | 2555153030542601 |
oct | 303501121335315 |
9 | 52534685758182 |
10 | 13443403201229 |
11 | 4313351702631 |
12 | 1611508646b25 |
13 | 766927452c41 |
14 | 346942757501 |
15 | 184a6170321e |
hex | c3a0945bacd |
13443403201229 has 2 divisors, whose sum is σ = 13443403201230. Its totient is φ = 13443403201228.
The previous prime is 13443403201213. The next prime is 13443403201247. The reversal of 13443403201229 is 92210230434431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8238754124329 + 5204649076900 = 2870323^2 + 2281370^2 .
It is a cyclic number.
It is not a de Polignac number, because 13443403201229 - 24 = 13443403201213 is a prime.
It is a super-2 number, since 2×134434032012292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13443403201192 and 13443403201201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13443403201279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6721701600614 + 6721701600615.
It is an arithmetic number, because the mean of its divisors is an integer number (6721701600615).
Almost surely, 213443403201229 is an apocalyptic number.
It is an amenable number.
13443403201229 is a deficient number, since it is larger than the sum of its proper divisors (1).
13443403201229 is an equidigital number, since it uses as much as digits as its factorization.
13443403201229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 13443403201229 in words is "thirteen trillion, four hundred forty-three billion, four hundred three million, two hundred one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •