Base | Representation |
---|---|
bin | 1010000000011010011001… |
… | …0110101110101001010101 |
3 | 1102221210121101112002210101 |
4 | 2200012212112232221111 |
5 | 2420230002232034031 |
6 | 35222201504454101 |
7 | 2213611553563165 |
oct | 240064626565125 |
9 | 42853541462711 |
10 | 11002202221141 |
11 | 356200a36628a |
12 | 129837331a331 |
13 | 61a6707526a1 |
14 | 2a071bc305a5 |
15 | 1412d4bb4361 |
hex | a01a65aea55 |
11002202221141 has 2 divisors, whose sum is σ = 11002202221142. Its totient is φ = 11002202221140.
The previous prime is 11002202221091. The next prime is 11002202221189. The reversal of 11002202221141 is 14112220220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9928460694916 + 1073741526225 = 3150946^2 + 1036215^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002202221141 - 27 = 11002202221013 is a prime.
It is a super-3 number, since 3×110022022211413 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002202221741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501101110570 + 5501101110571.
It is an arithmetic number, because the mean of its divisors is an integer number (5501101110571).
Almost surely, 211002202221141 is an apocalyptic number.
It is an amenable number.
11002202221141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002202221141 is an equidigital number, since it uses as much as digits as its factorization.
11002202221141 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 11002202221141 its reverse (14112220220011), we get a palindrome (25114422441152).
The spelling of 11002202221141 in words is "eleven trillion, two billion, two hundred two million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •