Base | Representation |
---|---|
bin | 1000000011001010… |
… | …1010000011111101 |
3 | 12120120212010210012 |
4 | 2000302222003331 |
5 | 13411123410013 |
6 | 554224353005 |
7 | 104355116654 |
oct | 20062520375 |
9 | 5516763705 |
10 | 2160763133 |
11 | a09770361 |
12 | 503775765 |
13 | 285874289 |
14 | 166d8619b |
15 | c9a6b1a8 |
hex | 80caa0fd |
2160763133 has 2 divisors, whose sum is σ = 2160763134. Its totient is φ = 2160763132.
The previous prime is 2160763127. The next prime is 2160763139. The reversal of 2160763133 is 3313670612.
It is a balanced prime because it is at equal distance from previous prime (2160763127) and next prime (2160763139).
It can be written as a sum of positive squares in only one way, i.e., 2012240164 + 148522969 = 44858^2 + 12187^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2160763133 is a prime.
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 2160763133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2160763139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1080381566 + 1080381567.
It is an arithmetic number, because the mean of its divisors is an integer number (1080381567).
Almost surely, 22160763133 is an apocalyptic number.
It is an amenable number.
2160763133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2160763133 is an equidigital number, since it uses as much as digits as its factorization.
2160763133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13608, while the sum is 32.
The square root of 2160763133 is about 46484.0094333525. The cubic root of 2160763133 is about 1292.8130294471.
The spelling of 2160763133 in words is "two billion, one hundred sixty million, seven hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •