Base | Representation |
---|---|
bin | 111101100110110… |
… | …0110100010110001 |
3 | 12100001201202222012 |
4 | 1323031212202301 |
5 | 13213143211223 |
6 | 541042252305 |
7 | 102140412125 |
oct | 17315464261 |
9 | 5301652865 |
10 | 2067163313 |
11 | 970950436 |
12 | 498357095 |
13 | 26c361977 |
14 | 15877d585 |
15 | c172cc78 |
hex | 7b3668b1 |
2067163313 has 2 divisors, whose sum is σ = 2067163314. Its totient is φ = 2067163312.
The previous prime is 2067163283. The next prime is 2067163327. The reversal of 2067163313 is 3133617602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2066338849 + 824464 = 45457^2 + 908^2 .
It is a cyclic number.
It is not a de Polignac number, because 2067163313 - 230 = 993421489 is a prime.
It is a super-2 number, since 2×20671633132 = 8546328325226271938, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2067163313.
It is not a weakly prime, because it can be changed into another prime (2067165313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1033581656 + 1033581657.
It is an arithmetic number, because the mean of its divisors is an integer number (1033581657).
Almost surely, 22067163313 is an apocalyptic number.
It is an amenable number.
2067163313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2067163313 is an equidigital number, since it uses as much as digits as its factorization.
2067163313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 32.
The square root of 2067163313 is about 45466.0677098867. The cubic root of 2067163313 is about 1273.8694708655.
The spelling of 2067163313 in words is "two billion, sixty-seven million, one hundred sixty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •