Base | Representation |
---|---|
bin | 11011110100010101101111… |
… | …111010110110000101000101 |
3 | 121001011222022012001200110022 |
4 | 123310111233322312011011 |
5 | 112013441023401422042 |
6 | 1112112022320304525 |
7 | 34525030616040323 |
oct | 3364255772660505 |
9 | 531158265050408 |
10 | 122344021123397 |
11 | 35a89898470907 |
12 | 1187b111172145 |
13 | 5335cb797b448 |
14 | 222d6a72c0d13 |
15 | e226ae822cd2 |
hex | 6f456feb6145 |
122344021123397 has 2 divisors, whose sum is σ = 122344021123398. Its totient is φ = 122344021123396.
The previous prime is 122344021123327. The next prime is 122344021123421. The reversal of 122344021123397 is 793321120443221.
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., 73506719843236 + 48837301280161 = 8573606^2 + 6988369^2 .
It is a cyclic number.
It is not a de Polignac number, because 122344021123397 - 216 = 122344021057861 is a prime.
It is a super-2 number, since 2×1223440211233972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122344021123327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61172010561698 + 61172010561699.
It is an arithmetic number, because the mean of its divisors is an integer number (61172010561699).
Almost surely, 2122344021123397 is an apocalyptic number.
It is an amenable number.
122344021123397 is a deficient number, since it is larger than the sum of its proper divisors (1).
122344021123397 is an equidigital number, since it uses as much as digits as its factorization.
122344021123397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 435456, while the sum is 44.
The spelling of 122344021123397 in words is "one hundred twenty-two trillion, three hundred forty-four billion, twenty-one million, one hundred twenty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •