Base | Representation |
---|---|
bin | 11011110011101101101011… |
… | …101110100110100010111111 |
3 | 121001000212021001100200212212 |
4 | 123303231223232212202333 |
5 | 112012234422242212343 |
6 | 1112040145420451035 |
7 | 34521645551122454 |
oct | 3363555356464277 |
9 | 531025231320785 |
10 | 122301001132223 |
11 | 35a726218387a1 |
12 | 118729059a9a7b |
13 | 5331c20035274 |
14 | 222b5859c582b |
15 | e214e2b48c18 |
hex | 6f3b6bba68bf |
122301001132223 has 2 divisors, whose sum is σ = 122301001132224. Its totient is φ = 122301001132222.
The previous prime is 122301001132201. The next prime is 122301001132231. The reversal of 122301001132223 is 322231100103221.
It is a strong prime.
It is an emirp because it is prime and its reverse (322231100103221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122301001132223 - 236 = 122232281655487 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122301001132273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61150500566111 + 61150500566112.
It is an arithmetic number, because the mean of its divisors is an integer number (61150500566112).
Almost surely, 2122301001132223 is an apocalyptic number.
122301001132223 is a deficient number, since it is larger than the sum of its proper divisors (1).
122301001132223 is an equidigital number, since it uses as much as digits as its factorization.
122301001132223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 122301001132223 its reverse (322231100103221), we get a palindrome (444532101235444).
The spelling of 122301001132223 in words is "one hundred twenty-two trillion, three hundred one billion, one million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •