Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1010100110101000001101 |
3 | 1110000121200210020002200001 |
4 | 2200120103322212220031 |
5 | 2421032424333224323 |
6 | 35235024554204301 |
7 | 2215154053044322 |
oct | 240302372465015 |
9 | 43017623202601 |
10 | 11021220211213 |
11 | 356a089539753 |
12 | 129bba0423691 |
13 | 61c3b184b754 |
14 | 2a160392cb49 |
15 | 141a496043ad |
hex | a0613ea6a0d |
11021220211213 has 2 divisors, whose sum is σ = 11021220211214. Its totient is φ = 11021220211212.
The previous prime is 11021220211087. The next prime is 11021220211223. The reversal of 11021220211213 is 31211202212011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9434837137924 + 1586383073289 = 3071618^2 + 1259517^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021220211213 - 221 = 11021218114061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021220211223) 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, 5510610105606 + 5510610105607.
It is an arithmetic number, because the mean of its divisors is an integer number (5510610105607).
Almost surely, 211021220211213 is an apocalyptic number.
It is an amenable number.
11021220211213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021220211213 is an equidigital number, since it uses as much as digits as its factorization.
11021220211213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11021220211213 its reverse (31211202212011), we get a palindrome (42232422423224).
The spelling of 11021220211213 in words is "eleven trillion, twenty-one billion, two hundred twenty million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •