Base | Representation |
---|---|
bin | 11011110100001000110011… |
… | …101010111100101000011001 |
3 | 121001010122102202211212101222 |
4 | 123310020303222330220121 |
5 | 112013224044101433311 |
6 | 1112101403411221425 |
7 | 34524026355363554 |
oct | 3364106352745031 |
9 | 531118382755358 |
10 | 122330125421081 |
11 | 35a83a0772a006 |
12 | 118784935a7875 |
13 | 53348b1b59296 |
14 | 222cb499d769b |
15 | e22149942adb |
hex | 6f4233abca19 |
122330125421081 has 2 divisors, whose sum is σ = 122330125421082. Its totient is φ = 122330125421080.
The previous prime is 122330125421059. The next prime is 122330125421111. The reversal of 122330125421081 is 180124521033221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85007312043481 + 37322813377600 = 9219941^2 + 6109240^2 .
It is a cyclic number.
It is not a de Polignac number, because 122330125421081 - 26 = 122330125421017 is a prime.
It is a super-3 number, since 3×1223301254210813 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (122330125421381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165062710540 + 61165062710541.
It is an arithmetic number, because the mean of its divisors is an integer number (61165062710541).
Almost surely, 2122330125421081 is an apocalyptic number.
It is an amenable number.
122330125421081 is a deficient number, since it is larger than the sum of its proper divisors (1).
122330125421081 is an equidigital number, since it uses as much as digits as its factorization.
122330125421081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 35.
The spelling of 122330125421081 in words is "one hundred twenty-two trillion, three hundred thirty billion, one hundred twenty-five million, four hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •