Base | Representation |
---|---|
bin | 11011101111101001000001… |
… | …100101000101011111011101 |
3 | 121000001002211201201221222102 |
4 | 123233221001211011133131 |
5 | 111443143224001321341 |
6 | 1111303421300454445 |
7 | 34462510063225211 |
oct | 3357510145053735 |
9 | 530032751657872 |
10 | 122021121120221 |
11 | 35974959874254 |
12 | 118286166aa425 |
13 | 53117087028cb |
14 | 221bbd4a80941 |
15 | e190b1a07c9b |
hex | 6efa419457dd |
122021121120221 has 2 divisors, whose sum is σ = 122021121120222. Its totient is φ = 122021121120220.
The previous prime is 122021121120209. The next prime is 122021121120307.
122021121120221 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117161790256900 + 4859330863321 = 10824130^2 + 2204389^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 122021121120221 - 234 = 122003941251037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122021121120193 and 122021121120202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122021121120721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61010560560110 + 61010560560111.
It is an arithmetic number, because the mean of its divisors is an integer number (61010560560111).
Almost surely, 2122021121120221 is an apocalyptic number.
It is an amenable number.
122021121120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
122021121120221 is an equidigital number, since it uses as much as digits as its factorization.
122021121120221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
The spelling of 122021121120221 in words is "one hundred twenty-two trillion, twenty-one billion, one hundred twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •