Base | Representation |
---|---|
bin | 1010000001100001001101… |
… | …1000010110000000000101 |
3 | 1110000121200011022211001102 |
4 | 2200120103120112000011 |
5 | 2421032420033331323 |
6 | 35235024033505445 |
7 | 2215153613520542 |
oct | 240302330260005 |
9 | 43017604284042 |
10 | 11021211230213 |
11 | 356a084465138 |
12 | 129bb99412285 |
13 | 61c3aca25952 |
14 | 2a1602671bc9 |
15 | 141a4892d328 |
hex | a0613616005 |
11021211230213 has 2 divisors, whose sum is σ = 11021211230214. Its totient is φ = 11021211230212.
The previous prime is 11021211230191. The next prime is 11021211230231. The reversal of 11021211230213 is 31203211212011.
Together with next prime (11021211230231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10541437510564 + 479773719649 = 3246758^2 + 692657^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11021211230213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021211230273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510605615106 + 5510605615107.
It is an arithmetic number, because the mean of its divisors is an integer number (5510605615107).
Almost surely, 211021211230213 is an apocalyptic number.
It is an amenable number.
11021211230213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021211230213 is an equidigital number, since it uses as much as digits as its factorization.
11021211230213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11021211230213 its reverse (31203211212011), we get a palindrome (42224422442224).
The spelling of 11021211230213 in words is "eleven trillion, twenty-one billion, two hundred eleven million, two hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •