Base | Representation |
---|---|
bin | 11011110101110001111101… |
… | …011011110001011011101001 |
3 | 121001112102212102200202220001 |
4 | 123311301331123301123221 |
5 | 112022101312204403404 |
6 | 1112225315153303001 |
7 | 34535134323361315 |
oct | 3365617533613351 |
9 | 531472772622801 |
10 | 122443032106729 |
11 | 360178865a5064 |
12 | 11896343864a61 |
13 | 53424365c8009 |
14 | 22343bac52b45 |
15 | e25056cea7a4 |
hex | 6f5c7d6f16e9 |
122443032106729 has 2 divisors, whose sum is σ = 122443032106730. Its totient is φ = 122443032106728.
The previous prime is 122443032106727. The next prime is 122443032106867. The reversal of 122443032106729 is 927601230344221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80742085635600 + 41700946471129 = 8985660^2 + 6457627^2 .
It is a cyclic number.
It is not a de Polignac number, because 122443032106729 - 21 = 122443032106727 is a prime.
It is a super-2 number, since 2×1224430321067292 (a number of 29 digits) contains 22 as substring.
Together with 122443032106727, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (122443032106727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61221516053364 + 61221516053365.
It is an arithmetic number, because the mean of its divisors is an integer number (61221516053365).
Almost surely, 2122443032106729 is an apocalyptic number.
It is an amenable number.
122443032106729 is a deficient number, since it is larger than the sum of its proper divisors (1).
122443032106729 is an equidigital number, since it uses as much as digits as its factorization.
122443032106729 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 870912, while the sum is 46.
The spelling of 122443032106729 in words is "one hundred twenty-two trillion, four hundred forty-three billion, thirty-two million, one hundred six thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •