Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0010011010110110100101 |
3 | 1102222120021121201210202102 |
4 | 2200032003302122312211 |
5 | 2420342403311242013 |
6 | 35230004402421445 |
7 | 2214314215434461 |
oct | 240160362326645 |
9 | 42876247653672 |
10 | 11010212212133 |
11 | 356544a838052 |
12 | 1299a29961885 |
13 | 61b349083224 |
14 | 2a0c7b9794a1 |
15 | 141602ed4d58 |
hex | a0383c9ada5 |
11010212212133 has 2 divisors, whose sum is σ = 11010212212134. Its totient is φ = 11010212212132.
The previous prime is 11010212212039. The next prime is 11010212212151. The reversal of 11010212212133 is 33121221201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6367941216484 + 4642270995649 = 2523478^2 + 2154593^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010212212133 - 222 = 11010208017829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010212212633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505106106066 + 5505106106067.
It is an arithmetic number, because the mean of its divisors is an integer number (5505106106067).
Almost surely, 211010212212133 is an apocalyptic number.
It is an amenable number.
11010212212133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010212212133 is an equidigital number, since it uses as much as digits as its factorization.
11010212212133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11010212212133 its reverse (33121221201011), we get a palindrome (44131433413144).
The spelling of 11010212212133 in words is "eleven trillion, ten billion, two hundred twelve million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •