Base | Representation |
---|---|
bin | 1010000000111000001100… |
… | …1100010011111000111101 |
3 | 1102222120020220221021001201 |
4 | 2200032003030103320331 |
5 | 2420342343232102031 |
6 | 35230003404335501 |
7 | 2214314034506233 |
oct | 240160314237075 |
9 | 42876226837051 |
10 | 11010202222141 |
11 | 3565445134461 |
12 | 1299a26544591 |
13 | 61b346c960a5 |
14 | 2a0c7a4d8953 |
15 | 1416021aed61 |
hex | a0383313e3d |
11010202222141 has 2 divisors, whose sum is σ = 11010202222142. Its totient is φ = 11010202222140.
The previous prime is 11010202222087. The next prime is 11010202222153. The reversal of 11010202222141 is 14122220201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8442244046916 + 2567958175225 = 2905554^2 + 1602485^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010202222141 - 27 = 11010202222013 is a prime.
It is a super-2 number, since 2×110102022221412 (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 (11010202222241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505101111070 + 5505101111071.
It is an arithmetic number, because the mean of its divisors is an integer number (5505101111071).
Almost surely, 211010202222141 is an apocalyptic number.
It is an amenable number.
11010202222141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010202222141 is an equidigital number, since it uses as much as digits as its factorization.
11010202222141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11010202222141 its reverse (14122220201011), we get a palindrome (25132422423152).
The spelling of 11010202222141 in words is "eleven trillion, ten billion, two hundred two million, two hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •