Base | Representation |
---|---|
bin | 11011110010100011010001… |
… | …010100100011001011000101 |
3 | 121000202020000200112121011102 |
4 | 123302203101110203023011 |
5 | 112004432303401400234 |
6 | 1111535333155545445 |
7 | 34513116552655034 |
oct | 3362432124431305 |
9 | 530666020477142 |
10 | 122221101200069 |
11 | 35a4175036a113 |
12 | 1185b3275bb285 |
13 | 5327528868ac1 |
14 | 222776625871b |
15 | e1e3b8344c7e |
hex | 6f28d15232c5 |
122221101200069 has 2 divisors, whose sum is σ = 122221101200070. Its totient is φ = 122221101200068.
The previous prime is 122221101200047. The next prime is 122221101200113. The reversal of 122221101200069 is 960002101122221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104832718276225 + 17388382923844 = 10238785^2 + 4169938^2 .
It is a cyclic number.
It is not a de Polignac number, because 122221101200069 - 240 = 121121589572293 is a prime.
It is a super-2 number, since 2×1222211012000692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122221101200969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61110550600034 + 61110550600035.
It is an arithmetic number, because the mean of its divisors is an integer number (61110550600035).
Almost surely, 2122221101200069 is an apocalyptic number.
It is an amenable number.
122221101200069 is a deficient number, since it is larger than the sum of its proper divisors (1).
122221101200069 is an equidigital number, since it uses as much as digits as its factorization.
122221101200069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 29.
The spelling of 122221101200069 in words is "one hundred twenty-two trillion, two hundred twenty-one billion, one hundred one million, two hundred thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •