Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …0100010011110000100101 |
3 | 1110100012110101222012111112 |
4 | 2201223323310103300211 |
5 | 2424020322104033333 |
6 | 35344154433514405 |
7 | 2224513122404636 |
oct | 241537364236045 |
9 | 43305411865445 |
10 | 11111010221093 |
11 | 35a4175674092 |
12 | 12b547aa12a05 |
13 | 6279c0cc9503 |
14 | 2a5ac09a788d |
15 | 144052301948 |
hex | a1afbd13c25 |
11111010221093 has 2 divisors, whose sum is σ = 11111010221094. Its totient is φ = 11111010221092.
The previous prime is 11111010221071. The next prime is 11111010221147. The reversal of 11111010221093 is 39012201011111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11009110728004 + 101899493089 = 3317998^2 + 319217^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111010221093 - 220 = 11111009172517 is a prime.
It is a super-2 number, since 2×111110102210932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111010221063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555505110546 + 5555505110547.
It is an arithmetic number, because the mean of its divisors is an integer number (5555505110547).
Almost surely, 211111010221093 is an apocalyptic number.
It is an amenable number.
11111010221093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111010221093 is an equidigital number, since it uses as much as digits as its factorization.
11111010221093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
The spelling of 11111010221093 in words is "eleven trillion, one hundred eleven billion, ten million, two hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •