Base | Representation |
---|---|
bin | 11011101111101010000010… |
… | …000101010110011010111101 |
3 | 121000001012122011002101222121 |
4 | 123233222002011112122331 |
5 | 111443202433022214442 |
6 | 1111304120520042541 |
7 | 34462545643613461 |
oct | 3357520205263275 |
9 | 530035564071877 |
10 | 122022203319997 |
11 | 35975364730a32 |
12 | 11828879003451 |
13 | 531184b9904c6 |
14 | 221bc986a84a1 |
15 | e19126a24967 |
hex | 6efa821566bd |
122022203319997 has 2 divisors, whose sum is σ = 122022203319998. Its totient is φ = 122022203319996.
The previous prime is 122022203319979. The next prime is 122022203320001. The reversal of 122022203319997 is 799913302220221.
Together with previous prime (122022203319979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94768102781881 + 27254100538116 = 9734891^2 + 5220546^2 .
It is a cyclic number.
It is not a de Polignac number, because 122022203319997 - 223 = 122022194931389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122022203319917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61011101659998 + 61011101659999.
It is an arithmetic number, because the mean of its divisors is an integer number (61011101659999).
Almost surely, 2122022203319997 is an apocalyptic number.
It is an amenable number.
122022203319997 is a deficient number, since it is larger than the sum of its proper divisors (1).
122022203319997 is an equidigital number, since it uses as much as digits as its factorization.
122022203319997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1469664, while the sum is 52.
The spelling of 122022203319997 in words is "one hundred twenty-two trillion, twenty-two billion, two hundred three million, three hundred nineteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •