Base | Representation |
---|---|
bin | 1100000001101000100111… |
… | …1011001001010001000001 |
3 | 1201211000212110212211212121 |
4 | 3000122021323021101001 |
5 | 3213113103132221004 |
6 | 44042112221324241 |
7 | 2533163006556235 |
oct | 300321173112101 |
9 | 51730773784777 |
10 | 13222223320129 |
11 | 42385713a826a |
12 | 159667ba06681 |
13 | 74bb0918a255 |
14 | 339d5d7ba5c5 |
15 | 17de18b4d854 |
hex | c0689ec9441 |
13222223320129 has 2 divisors, whose sum is σ = 13222223320130. Its totient is φ = 13222223320128.
The previous prime is 13222223320099. The next prime is 13222223320211. The reversal of 13222223320129 is 92102332222231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12494648439729 + 727574880400 = 3534777^2 + 852980^2 .
It is a cyclic number.
It is not a de Polignac number, because 13222223320129 - 213 = 13222223311937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13222223320094 and 13222223320103.
It is not a weakly prime, because it can be changed into another prime (13222223320429) 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, 6611111660064 + 6611111660065.
It is an arithmetic number, because the mean of its divisors is an integer number (6611111660065).
Almost surely, 213222223320129 is an apocalyptic number.
It is an amenable number.
13222223320129 is a deficient number, since it is larger than the sum of its proper divisors (1).
13222223320129 is an equidigital number, since it uses as much as digits as its factorization.
13222223320129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 13222223320129 in words is "thirteen trillion, two hundred twenty-two billion, two hundred twenty-three million, three hundred twenty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •