Base | Representation |
---|---|
bin | 110100001001110000001010… |
… | …111110001111100000110001 |
3 | 1010002010102111022212211210121 |
4 | 310021300022332033200301 |
5 | 220030433412044023314 |
6 | 2131454253243530241 |
7 | 66212223110610064 |
oct | 6411601276174061 |
9 | 1102112438784717 |
10 | 229368617564209 |
11 | 670a1758a95362 |
12 | 21885211b29981 |
13 | 9aca4a21698a6 |
14 | 408d700c628db |
15 | 1b7b60dd4ad24 |
hex | d09c0af8f831 |
229368617564209 has 2 divisors, whose sum is σ = 229368617564210. Its totient is φ = 229368617564208.
The previous prime is 229368617564147. The next prime is 229368617564267. The reversal of 229368617564209 is 902465716863922.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 174912659957025 + 54455957607184 = 13225455^2 + 7379428^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-229368617564209 is a prime.
It is not a weakly prime, because it can be changed into another prime (229368617564279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114684308782104 + 114684308782105.
It is an arithmetic number, because the mean of its divisors is an integer number (114684308782105).
It is a 1-persistent number, because it is pandigital, but 2⋅229368617564209 = 458737235128418 is not.
Almost surely, 2229368617564209 is an apocalyptic number.
It is an amenable number.
229368617564209 is a deficient number, since it is larger than the sum of its proper divisors (1).
229368617564209 is an equidigital number, since it uses as much as digits as its factorization.
229368617564209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 470292480, while the sum is 70.
The spelling of 229368617564209 in words is "two hundred twenty-nine trillion, three hundred sixty-eight billion, six hundred seventeen million, five hundred sixty-four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •