Base | Representation |
---|---|
bin | 10000010100000010001… |
… | …000011001011101110111 |
3 | 10222011112222002012102002 |
4 | 100110002020121131313 |
5 | 121331323142021101 |
6 | 2214553540405515 |
7 | 143663655436061 |
oct | 20240210313567 |
9 | 3864488065362 |
10 | 1121022220151 |
11 | 3a2471900159 |
12 | 1613180a689b |
13 | 8193419cbb2 |
14 | 3c387442731 |
15 | 1e26133bd6b |
hex | 10502219777 |
1121022220151 has 2 divisors, whose sum is σ = 1121022220152. Its totient is φ = 1121022220150.
The previous prime is 1121022220103. The next prime is 1121022220169. The reversal of 1121022220151 is 1510222201211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1510222201211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121022220151 - 234 = 1103842350967 is a prime.
It is a super-2 number, since 2×11210222201512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121022220051) 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, 560511110075 + 560511110076.
It is an arithmetic number, because the mean of its divisors is an integer number (560511110076).
Almost surely, 21121022220151 is an apocalyptic number.
1121022220151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121022220151 is an equidigital number, since it uses as much as digits as its factorization.
1121022220151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 20.
Adding to 1121022220151 its reverse (1510222201211), we get a palindrome (2631244421362).
The spelling of 1121022220151 in words is "one trillion, one hundred twenty-one billion, twenty-two million, two hundred twenty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •