Base | Representation |
---|---|
bin | 1010010011000011010011… |
… | …1110001111000100000001 |
3 | 1111002102011002111211220111 |
4 | 2210300310332033010001 |
5 | 2441001310131201423 |
6 | 40025241001111321 |
7 | 2246006120331403 |
oct | 244606476170401 |
9 | 44072132454814 |
10 | 11322422522113 |
11 | 36758a337aa1a |
12 | 132a440488541 |
13 | 6419137a0611 |
14 | 2b2018602b73 |
15 | 1497c760860d |
hex | a4c34f8f101 |
11322422522113 has 2 divisors, whose sum is σ = 11322422522114. Its totient is φ = 11322422522112.
The previous prime is 11322422522101. The next prime is 11322422522123. The reversal of 11322422522113 is 31122522422311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11061963358209 + 260459163904 = 3325953^2 + 510352^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11322422522113 is a prime.
It is not a weakly prime, because it can be changed into another prime (11322422522123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661211261056 + 5661211261057.
It is an arithmetic number, because the mean of its divisors is an integer number (5661211261057).
Almost surely, 211322422522113 is an apocalyptic number.
It is an amenable number.
11322422522113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11322422522113 is an equidigital number, since it uses as much as digits as its factorization.
11322422522113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11520, while the sum is 31.
Adding to 11322422522113 its reverse (31122522422311), we get a palindrome (42444944944424).
The spelling of 11322422522113 in words is "eleven trillion, three hundred twenty-two billion, four hundred twenty-two million, five hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •