Base | Representation |
---|---|
bin | 11011110100001000110010… |
… | …111011101100101100100111 |
3 | 121001010122101220112120221222 |
4 | 123310020302323230230213 |
5 | 112013224032414110142 |
6 | 1112101402245530555 |
7 | 34524026145165641 |
oct | 3364106273545447 |
9 | 531118356476858 |
10 | 122330113035047 |
11 | 35a83a0073a215 |
12 | 1187848b413a5b |
13 | 53348ac410678 |
14 | 222cb480d1891 |
15 | e221487e7bd2 |
hex | 6f4232eecb27 |
122330113035047 has 2 divisors, whose sum is σ = 122330113035048. Its totient is φ = 122330113035046.
The previous prime is 122330113035007. The next prime is 122330113035049. The reversal of 122330113035047 is 740530311033221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122330113035047 - 28 = 122330113034791 is a prime.
Together with 122330113035049, 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 = 122330113034998 and 122330113035016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122330113035049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165056517523 + 61165056517524.
It is an arithmetic number, because the mean of its divisors is an integer number (61165056517524).
Almost surely, 2122330113035047 is an apocalyptic number.
122330113035047 is a deficient number, since it is larger than the sum of its proper divisors (1).
122330113035047 is an equidigital number, since it uses as much as digits as its factorization.
122330113035047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 45360, while the sum is 35.
Adding to 122330113035047 its reverse (740530311033221), we get a palindrome (862860424068268).
The spelling of 122330113035047 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred thirteen million, thirty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •