Base | Representation |
---|---|
bin | 110100010010010100000111… |
… | …000100010110000101110101 |
3 | 1010011012200010002211002101001 |
4 | 310102110013010112011311 |
5 | 220120103324404342314 |
6 | 2133024434211203301 |
7 | 66302561621644636 |
oct | 6422240704260565 |
9 | 1104180102732331 |
10 | 229956962574709 |
11 | 672a9222453827 |
12 | 2195b2495a6531 |
13 | 9b40b0528c6b6 |
14 | 40add9525788d |
15 | 1b8ba95898674 |
hex | d12507116175 |
229956962574709 has 2 divisors, whose sum is σ = 229956962574710. Its totient is φ = 229956962574708.
The previous prime is 229956962574673. The next prime is 229956962574727. The reversal of 229956962574709 is 907475269659922.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119791996172209 + 110164966402500 = 10944953^2 + 10495950^2 .
It is a cyclic number.
It is not a de Polignac number, because 229956962574709 - 231 = 229954815091061 is a prime.
It is a super-2 number, since 2×2299569625747092 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (229956962574109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114978481287354 + 114978481287355.
It is an arithmetic number, because the mean of its divisors is an integer number (114978481287355).
Almost surely, 2229956962574709 is an apocalyptic number.
It is an amenable number.
229956962574709 is a deficient number, since it is larger than the sum of its proper divisors (1).
229956962574709 is an equidigital number, since it uses as much as digits as its factorization.
229956962574709 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9258883200, while the sum is 82.
The spelling of 229956962574709 in words is "two hundred twenty-nine trillion, nine hundred fifty-six billion, nine hundred sixty-two million, five hundred seventy-four thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •