Base | Representation |
---|---|
bin | 1010010011000001110100… |
… | …0011000000110001010101 |
3 | 1111002101010010012120020122 |
4 | 2210300131003000301111 |
5 | 2440444444401333414 |
6 | 40025133101441325 |
7 | 2245663144433156 |
oct | 244603503006125 |
9 | 44071103176218 |
10 | 11322021121109 |
11 | 3675707838456 |
12 | 132a349b70245 |
13 | 64187b58b42a |
14 | 2b1dbb19592d |
15 | 1497a2269b8e |
hex | a4c1d0c0c55 |
11322021121109 has 2 divisors, whose sum is σ = 11322021121110. Its totient is φ = 11322021121108.
The previous prime is 11322021121027. The next prime is 11322021121183. The reversal of 11322021121109 is 90112112022311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8639796058609 + 2682225062500 = 2939353^2 + 1637750^2 .
It is an emirp because it is prime and its reverse (90112112022311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11322021121109 - 212 = 11322021117013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11322021121409) 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, 5661010560554 + 5661010560555.
It is an arithmetic number, because the mean of its divisors is an integer number (5661010560555).
Almost surely, 211322021121109 is an apocalyptic number.
It is an amenable number.
11322021121109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11322021121109 is an equidigital number, since it uses as much as digits as its factorization.
11322021121109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 26.
The spelling of 11322021121109 in words is "eleven trillion, three hundred twenty-two billion, twenty-one million, one hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •