Base | Representation |
---|---|
bin | 111000111110000101… |
… | …0011110001010010101 |
3 | 102200210020102220102201 |
4 | 1301330022132022111 |
5 | 4001024101012203 |
6 | 132111522004501 |
7 | 11560516401436 |
oct | 1617412361225 |
9 | 380706386381 |
10 | 122342204053 |
11 | 47980a91753 |
12 | 1b8641a6731 |
13 | b6c9518324 |
14 | 5cc843d48d |
15 | 32b0911e1d |
hex | 1c7c29e295 |
122342204053 has 2 divisors, whose sum is σ = 122342204054. Its totient is φ = 122342204052.
The previous prime is 122342203993. The next prime is 122342204057. The reversal of 122342204053 is 350402243221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122315969169 + 26234884 = 349737^2 + 5122^2 .
It is a cyclic number.
It is not a de Polignac number, because 122342204053 - 29 = 122342203541 is a prime.
It is a super-2 number, since 2×1223422040532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122342204057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61171102026 + 61171102027.
It is an arithmetic number, because the mean of its divisors is an integer number (61171102027).
Almost surely, 2122342204053 is an apocalyptic number.
It is an amenable number.
122342204053 is a deficient number, since it is larger than the sum of its proper divisors (1).
122342204053 is an equidigital number, since it uses as much as digits as its factorization.
122342204053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 122342204053 its reverse (350402243221), we get a palindrome (472744447274).
The spelling of 122342204053 in words is "one hundred twenty-two billion, three hundred forty-two million, two hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •