Base | Representation |
---|---|
bin | 11101010001000101100… |
… | …101010011110111011101 |
3 | 21010021021211101201000002 |
4 | 131101011211103313131 |
5 | 230422430244300013 |
6 | 4135534343144045 |
7 | 265206465544262 |
oct | 35210545236735 |
9 | 7107254351002 |
10 | 2011212103133 |
11 | 705a4a888922 |
12 | 285952a45025 |
13 | 11786c3c2c1c |
14 | 6d4b39b3269 |
15 | 374b24b7358 |
hex | 1d445953ddd |
2011212103133 has 2 divisors, whose sum is σ = 2011212103134. Its totient is φ = 2011212103132.
The previous prime is 2011212103099. The next prime is 2011212103141. The reversal of 2011212103133 is 3313012121102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1893918182809 + 117293920324 = 1376197^2 + 342482^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011212103133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011212103163) 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, 1005606051566 + 1005606051567.
It is an arithmetic number, because the mean of its divisors is an integer number (1005606051567).
Almost surely, 22011212103133 is an apocalyptic number.
It is an amenable number.
2011212103133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011212103133 is an equidigital number, since it uses as much as digits as its factorization.
2011212103133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2011212103133 its reverse (3313012121102), we get a palindrome (5324224224235).
The spelling of 2011212103133 in words is "two trillion, eleven billion, two hundred twelve million, one hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •