Base | Representation |
---|---|
bin | 11101110000000010001… |
… | …11110000001101001001 |
3 | 10121201112100012111210111 |
4 | 32320001013300031021 |
5 | 113222002040313441 |
6 | 2101334000114321 |
7 | 133565406233521 |
oct | 16700107601511 |
9 | 3551470174714 |
10 | 1022221026121 |
11 | 364581135799 |
12 | 1461439059a1 |
13 | 75519b572c9 |
14 | 376936c0681 |
15 | 1b8cc4a4081 |
hex | ee011f0349 |
1022221026121 has 2 divisors, whose sum is σ = 1022221026122. Its totient is φ = 1022221026120.
The previous prime is 1022221026107. The next prime is 1022221026131. The reversal of 1022221026121 is 1216201222201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 519732855625 + 502488170496 = 720925^2 + 708864^2 .
It is a cyclic number.
It is not a de Polignac number, because 1022221026121 - 223 = 1022212637513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1022221026092 and 1022221026101.
It is not a weakly prime, because it can be changed into another prime (1022221026131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511110513060 + 511110513061.
It is an arithmetic number, because the mean of its divisors is an integer number (511110513061).
Almost surely, 21022221026121 is an apocalyptic number.
It is an amenable number.
1022221026121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022221026121 is an equidigital number, since it uses as much as digits as its factorization.
1022221026121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 1022221026121 its reverse (1216201222201), we get a palindrome (2238422248322).
The spelling of 1022221026121 in words is "one trillion, twenty-two billion, two hundred twenty-one million, twenty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •