Base | Representation |
---|---|
bin | 1010000000010100001100… |
… | …00001011000101000111001 |
3 | 2212220021121110120210120222 |
4 | 11000022012001120220321 |
5 | 10340431143134000441 |
6 | 114443052534225425 |
7 | 4430345022621203 |
oct | 500120601305071 |
9 | 85807543523528 |
10 | 22001071000121 |
11 | 7012669016094 |
12 | 2573b561b5275 |
13 | c378cc6b4095 |
14 | 560c0105b773 |
15 | 282471dbbd4b |
hex | 140286058a39 |
22001071000121 has 2 divisors, whose sum is σ = 22001071000122. Its totient is φ = 22001071000120.
The previous prime is 22001071000079. The next prime is 22001071000133. The reversal of 22001071000121 is 12100017010022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19227663724096 + 2773407276025 = 4384936^2 + 1665355^2 .
It is a cyclic number.
It is not a de Polignac number, because 22001071000121 - 218 = 22001070737977 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22001071000121.
It is not a weakly prime, because it can be changed into another prime (22001071000141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000535500060 + 11000535500061.
It is an arithmetic number, because the mean of its divisors is an integer number (11000535500061).
Almost surely, 222001071000121 is an apocalyptic number.
It is an amenable number.
22001071000121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22001071000121 is an equidigital number, since it uses as much as digits as its factorization.
22001071000121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 22001071000121 its reverse (12100017010022), we get a palindrome (34101088010143).
The spelling of 22001071000121 in words is "twenty-two trillion, one billion, seventy-one million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •