Base | Representation |
---|---|
bin | 111000111010101111… |
… | …1101101111100101101 |
3 | 102200111102221021111212 |
4 | 1301311133231330231 |
5 | 4000311431130404 |
6 | 132052444124205 |
7 | 11554660455434 |
oct | 1616537557455 |
9 | 380442837455 |
10 | 122230333229 |
11 | 47923922524 |
12 | 1b832836665 |
13 | b6ac2a9584 |
14 | 5cb763c11b |
15 | 32a5bb506e |
hex | 1c757edf2d |
122230333229 has 2 divisors, whose sum is σ = 122230333230. Its totient is φ = 122230333228.
The previous prime is 122230333207. The next prime is 122230333231. The reversal of 122230333229 is 922333032221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90359157604 + 31871175625 = 300598^2 + 178525^2 .
It is a cyclic number.
It is not a de Polignac number, because 122230333229 - 236 = 53510856493 is a prime.
It is a super-2 number, since 2×1222303332292 (a number of 23 digits) contains 22 as substring.
Together with 122230333231, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 122230333195 and 122230333204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122230333279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61115166614 + 61115166615.
It is an arithmetic number, because the mean of its divisors is an integer number (61115166615).
Almost surely, 2122230333229 is an apocalyptic number.
It is an amenable number.
122230333229 is a deficient number, since it is larger than the sum of its proper divisors (1).
122230333229 is an equidigital number, since it uses as much as digits as its factorization.
122230333229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 32.
The spelling of 122230333229 in words is "one hundred twenty-two billion, two hundred thirty million, three hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •