Base | Representation |
---|---|
bin | 1000001000011110… |
… | …1111001001100101 |
3 | 12122010211020212012 |
4 | 2002013233021211 |
5 | 13432331104323 |
6 | 1000342404005 |
7 | 105045520346 |
oct | 20207571145 |
9 | 5563736765 |
10 | 2183066213 |
11 | a20313a59 |
12 | 50b130605 |
13 | 28a382a73 |
14 | 169d100cd |
15 | cb9c4678 |
hex | 821ef265 |
2183066213 has 2 divisors, whose sum is σ = 2183066214. Its totient is φ = 2183066212.
The previous prime is 2183066177. The next prime is 2183066219. The reversal of 2183066213 is 3126603812.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1508001889 + 675064324 = 38833^2 + 25982^2 .
It is a cyclic number.
It is not a de Polignac number, because 2183066213 - 212 = 2183062117 is a prime.
It is a super-2 number, since 2×21830662132 = 9531556180684322738, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2183066213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2183066219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1091533106 + 1091533107.
It is an arithmetic number, because the mean of its divisors is an integer number (1091533107).
Almost surely, 22183066213 is an apocalyptic number.
It is an amenable number.
2183066213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2183066213 is an equidigital number, since it uses as much as digits as its factorization.
2183066213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 2183066213 is about 46723.2941154624. The cubic root of 2183066213 is about 1297.2458879429.
The spelling of 2183066213 in words is "two billion, one hundred eighty-three million, sixty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •