Base | Representation |
---|---|
bin | 1010000010101011110000… |
… | …1011111111100101011001 |
3 | 1110002112022211101210100002 |
4 | 2200222330023333211121 |
5 | 2421344411120230403 |
6 | 35252133512022345 |
7 | 2216462542535066 |
oct | 240527413774531 |
9 | 43075284353302 |
10 | 11041223211353 |
11 | 3577613727825 |
12 | 12a3a433919b5 |
13 | 62124ba36aca |
14 | 2a2580395c6d |
15 | 14231a764188 |
hex | a0abc2ff959 |
11041223211353 has 2 divisors, whose sum is σ = 11041223211354. Its totient is φ = 11041223211352.
The previous prime is 11041223211301. The next prime is 11041223211371. The reversal of 11041223211353 is 35311232214011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10844026822729 + 197196388624 = 3293027^2 + 444068^2 .
It is a cyclic number.
It is not a de Polignac number, because 11041223211353 - 218 = 11041222949209 is a prime.
It is a super-2 number, since 2×110412232113532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11041223213353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5520611605676 + 5520611605677.
It is an arithmetic number, because the mean of its divisors is an integer number (5520611605677).
Almost surely, 211041223211353 is an apocalyptic number.
It is an amenable number.
11041223211353 is a deficient number, since it is larger than the sum of its proper divisors (1).
11041223211353 is an equidigital number, since it uses as much as digits as its factorization.
11041223211353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 11041223211353 its reverse (35311232214011), we get a palindrome (46352455425364).
The spelling of 11041223211353 in words is "eleven trillion, forty-one billion, two hundred twenty-three million, two hundred eleven thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •