Base | Representation |
---|---|
bin | 11101101111101010011… |
… | …01100011101100000001 |
3 | 10121201000102020100212022 |
4 | 32313311031203230001 |
5 | 113221044413033441 |
6 | 2101302101411225 |
7 | 133560432020615 |
oct | 16676515435401 |
9 | 3551012210768 |
10 | 1022021221121 |
11 | 36448937629a |
12 | 1460a8a09b15 |
13 | 754b763a9b4 |
14 | 37674d4d345 |
15 | 1b8b9b8784b |
hex | edf5363b01 |
1022021221121 has 2 divisors, whose sum is σ = 1022021221122. Its totient is φ = 1022021221120.
The previous prime is 1022021221099. The next prime is 1022021221127. The reversal of 1022021221121 is 1211221202201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 821626222096 + 200394999025 = 906436^2 + 447655^2 .
It is a cyclic number.
It is not a de Polignac number, because 1022021221121 - 26 = 1022021221057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1022021221121.
It is not a weakly prime, because it can be changed into another prime (1022021221127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511010610560 + 511010610561.
It is an arithmetic number, because the mean of its divisors is an integer number (511010610561).
Almost surely, 21022021221121 is an apocalyptic number.
It is an amenable number.
1022021221121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022021221121 is an equidigital number, since it uses as much as digits as its factorization.
1022021221121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1022021221121 its reverse (1211221202201), we get a palindrome (2233242423322).
The spelling of 1022021221121 in words is "one trillion, twenty-two billion, twenty-one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •