Base | Representation |
---|---|
bin | 110010010110001110010001… |
… | …101001111100000110111101 |
3 | 1002001000110012100212102200201 |
4 | 302112032101221330012331 |
5 | 213010400040023320314 |
6 | 2102535144445323501 |
7 | 64432516000300555 |
oct | 6226162151740675 |
9 | 1061013170772621 |
10 | 221429482635709 |
11 | 64610797325207 |
12 | 20a02625866591 |
13 | 96729312b9c4a |
14 | 3c9735bd00165 |
15 | 1a8ed50565b74 |
hex | c96391a7c1bd |
221429482635709 has 2 divisors, whose sum is σ = 221429482635710. Its totient is φ = 221429482635708.
The previous prime is 221429482635679. The next prime is 221429482635721. The reversal of 221429482635709 is 907536284924122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193884598820025 + 27544883815684 = 13924245^2 + 5248322^2 .
It is a cyclic number.
It is not a de Polignac number, because 221429482635709 - 25 = 221429482635677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221429482639709) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110714741317854 + 110714741317855.
It is an arithmetic number, because the mean of its divisors is an integer number (110714741317855).
It is a 1-persistent number, because it is pandigital, but 2⋅221429482635709 = 442858965271418 is not.
Almost surely, 2221429482635709 is an apocalyptic number.
It is an amenable number.
221429482635709 is a deficient number, since it is larger than the sum of its proper divisors (1).
221429482635709 is an equidigital number, since it uses as much as digits as its factorization.
221429482635709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104509440, while the sum is 64.
The spelling of 221429482635709 in words is "two hundred twenty-one trillion, four hundred twenty-nine billion, four hundred eighty-two million, six hundred thirty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •