Base | Representation |
---|---|
bin | 10111000000111110011100… |
… | …101000010111011000001001 |
3 | 111021101201222201122100112102 |
4 | 113000332130220113120021 |
5 | 101231410401223421131 |
6 | 555140445000323145 |
7 | 30215025355420406 |
oct | 2700763450273011 |
9 | 437351881570472 |
10 | 101222122092041 |
11 | 2a28607407a465 |
12 | b429637a734b5 |
13 | 446328895cb32 |
14 | 1add2693bd2ad |
15 | ba80466a41cb |
hex | 5c0f9ca17609 |
101222122092041 has 2 divisors, whose sum is σ = 101222122092042. Its totient is φ = 101222122092040.
The previous prime is 101222122091989. The next prime is 101222122092043. The reversal of 101222122092041 is 140290221222101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56909521945600 + 44312600146441 = 7543840^2 + 6656771^2 .
It is a cyclic number.
It is not a de Polignac number, because 101222122092041 - 218 = 101222121829897 is a prime.
Together with 101222122092043, 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 = 101222122091995 and 101222122092013.
It is not a weakly prime, because it can be changed into another prime (101222122092043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50611061046020 + 50611061046021.
It is an arithmetic number, because the mean of its divisors is an integer number (50611061046021).
Almost surely, 2101222122092041 is an apocalyptic number.
It is an amenable number.
101222122092041 is a deficient number, since it is larger than the sum of its proper divisors (1).
101222122092041 is an equidigital number, since it uses as much as digits as its factorization.
101222122092041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 29.
The spelling of 101222122092041 in words is "one hundred one trillion, two hundred twenty-two billion, one hundred twenty-two million, ninety-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •