Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …1001010111101001001101 |
3 | 1110100012201111212211101021 |
4 | 2201230001321113221031 |
5 | 2424021024211223041 |
6 | 35344212515514141 |
7 | 2224515501325444 |
oct | 241540171275115 |
9 | 43305644784337 |
10 | 11111112211021 |
11 | 35a42181a4689 |
12 | 12b54a8bb8951 |
13 | 627a09188994 |
14 | 2a5ad0355d5b |
15 | 14405b24acd1 |
hex | a1b01e57a4d |
11111112211021 has 2 divisors, whose sum is σ = 11111112211022. Its totient is φ = 11111112211020.
The previous prime is 11111112211009. The next prime is 11111112211093. The reversal of 11111112211021 is 12011221111111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8457191015625 + 2653921195396 = 2908125^2 + 1629086^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111112211021 - 219 = 11111111686733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111112210986 and 11111112211004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111112214021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555556105510 + 5555556105511.
It is an arithmetic number, because the mean of its divisors is an integer number (5555556105511).
Almost surely, 211111112211021 is an apocalyptic number.
It is an amenable number.
11111112211021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111112211021 is an equidigital number, since it uses as much as digits as its factorization.
11111112211021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 11111112211021 its reverse (12011221111111), we get a palindrome (23122333322132).
The spelling of 11111112211021 in words is "eleven trillion, one hundred eleven billion, one hundred twelve million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •