Base | Representation |
---|---|
bin | 11011110100000000010101… |
… | …101011100011101111011111 |
3 | 121001002202222001120222201111 |
4 | 123310000111223203233133 |
5 | 112013101433234031312 |
6 | 1112053301222522451 |
7 | 34523255132364544 |
oct | 3364002553435737 |
9 | 531082861528644 |
10 | 122321032330207 |
11 | 35a80070936277 |
12 | 11876776296427 |
13 | 5333a93014239 |
14 | 222c5260acbcb |
15 | e21cb64c88a7 |
hex | 6f4015ae3bdf |
122321032330207 has 2 divisors, whose sum is σ = 122321032330208. Its totient is φ = 122321032330206.
The previous prime is 122321032330187. The next prime is 122321032330213. The reversal of 122321032330207 is 702033230123221.
It is a strong prime.
It is an emirp because it is prime and its reverse (702033230123221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122321032330207 - 243 = 113524939307999 is a prime.
It is a super-2 number, since 2×1223210323302072 (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 (122321032330267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61160516165103 + 61160516165104.
It is an arithmetic number, because the mean of its divisors is an integer number (61160516165104).
Almost surely, 2122321032330207 is an apocalyptic number.
122321032330207 is a deficient number, since it is larger than the sum of its proper divisors (1).
122321032330207 is an equidigital number, since it uses as much as digits as its factorization.
122321032330207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 31.
Adding to 122321032330207 its reverse (702033230123221), we get a palindrome (824354262453428).
The spelling of 122321032330207 in words is "one hundred twenty-two trillion, three hundred twenty-one billion, thirty-two million, three hundred thirty thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •