Base | Representation |
---|---|
bin | 1100000001100100100011… |
… | …0100101100111001011101 |
3 | 1201210221001100200221000202 |
4 | 3000121020310230321131 |
5 | 3213103334031041104 |
6 | 44041412003433245 |
7 | 2533123645135121 |
oct | 300311064547135 |
9 | 51727040627022 |
10 | 13221131112029 |
11 | 4238060925145 |
12 | 1596416085825 |
13 | 74b993b07079 |
14 | 339c98709581 |
15 | 17dda2d0651e |
hex | c0648d2ce5d |
13221131112029 has 2 divisors, whose sum is σ = 13221131112030. Its totient is φ = 13221131112028.
The previous prime is 13221131111939. The next prime is 13221131112037. The reversal of 13221131112029 is 92021113112231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8674043999929 + 4547087112100 = 2945173^2 + 2132390^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13221131112029 is a prime.
It is a super-2 number, since 2×132211311120292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13221131111992 and 13221131112010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13221131112089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610565556014 + 6610565556015.
It is an arithmetic number, because the mean of its divisors is an integer number (6610565556015).
Almost surely, 213221131112029 is an apocalyptic number.
It is an amenable number.
13221131112029 is a deficient number, since it is larger than the sum of its proper divisors (1).
13221131112029 is an equidigital number, since it uses as much as digits as its factorization.
13221131112029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 13221131112029 in words is "thirteen trillion, two hundred twenty-one billion, one hundred thirty-one million, one hundred twelve thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •