Base | Representation |
---|---|
bin | 111011100110111… |
… | …1001110001100101 |
3 | 12011101121021222012 |
4 | 1313031321301211 |
5 | 13044013230341 |
6 | 530245444005 |
7 | 100364565122 |
oct | 16715716145 |
9 | 5141537865 |
10 | 2000133221 |
11 | 937028769 |
12 | 479a10605 |
13 | 25b4c2ba8 |
14 | 14d8d1749 |
15 | ba8dc0eb |
hex | 77379c65 |
2000133221 has 2 divisors, whose sum is σ = 2000133222. Its totient is φ = 2000133220.
The previous prime is 2000133203. The next prime is 2000133241. The reversal of 2000133221 is 1223310002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1076824225 + 923308996 = 32815^2 + 30386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000133221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000133196 and 2000133205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000133241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000066610 + 1000066611.
It is an arithmetic number, because the mean of its divisors is an integer number (1000066611).
Almost surely, 22000133221 is an apocalyptic number.
It is an amenable number.
2000133221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000133221 is an equidigital number, since it uses as much as digits as its factorization.
2000133221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2000133221 is about 44722.8489812534. The cubic root of 2000133221 is about 1259.9490239308.
Adding to 2000133221 its reverse (1223310002), we get a palindrome (3223443223).
The spelling of 2000133221 in words is "two billion, one hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •