Base | Representation |
---|---|
bin | 1010001101001101101100… |
… | …1100010101001110111001 |
3 | 1110201211021200020110212221 |
4 | 2203103123030111032321 |
5 | 2432330411244121103 |
6 | 35511213135404041 |
7 | 2235525615202405 |
oct | 243233314251671 |
9 | 43654250213787 |
10 | 11222132020153 |
11 | 3637308a6845a |
12 | 1312b11383621 |
13 | 63531ca3a332 |
14 | 2ab222b62105 |
15 | 146da7b391bd |
hex | a34db3153b9 |
11222132020153 has 2 divisors, whose sum is σ = 11222132020154. Its totient is φ = 11222132020152.
The previous prime is 11222132020139. The next prime is 11222132020213. The reversal of 11222132020153 is 35102023122211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10455573986064 + 766558034089 = 3233508^2 + 875533^2 .
It is a cyclic number.
It is not a de Polignac number, because 11222132020153 - 29 = 11222132019641 is a prime.
It is not a weakly prime, because it can be changed into another prime (11222132320153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5611066010076 + 5611066010077.
It is an arithmetic number, because the mean of its divisors is an integer number (5611066010077).
Almost surely, 211222132020153 is an apocalyptic number.
It is an amenable number.
11222132020153 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222132020153 is an equidigital number, since it uses as much as digits as its factorization.
11222132020153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 11222132020153 its reverse (35102023122211), we get a palindrome (46324155142364).
The spelling of 11222132020153 in words is "eleven trillion, two hundred twenty-two billion, one hundred thirty-two million, twenty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •