Base | Representation |
---|---|
bin | 1000000100001001… |
… | …1111001110110001 |
3 | 12120212122222102200 |
4 | 2001002133032301 |
5 | 13413204204243 |
6 | 554453333413 |
7 | 104435312631 |
oct | 20102371661 |
9 | 5525588380 |
10 | 2164913073 |
11 | a11045264 |
12 | 505037269 |
13 | 28669816b |
14 | 1677466c1 |
15 | ca0daad3 |
hex | 8109f3b1 |
2164913073 has 6 divisors (see below), whose sum is σ = 3127096674. Its totient is φ = 1443275376.
The previous prime is 2164913071. The next prime is 2164913081. The reversal of 2164913073 is 3703194612.
2164913073 is a `hidden beast` number, since 2 + 1 + 649 + 1 + 3 + 0 + 7 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1459851264 + 705061809 = 38208^2 + 26553^2 .
It is not a de Polignac number, because 2164913073 - 21 = 2164913071 is a prime.
It is a super-2 number, since 2×21649130732 = 9373697227292606658, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2164913071) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 120272940 + ... + 120272957.
It is an arithmetic number, because the mean of its divisors is an integer number (521182779).
Almost surely, 22164913073 is an apocalyptic number.
It is an amenable number.
2164913073 is a deficient number, since it is larger than the sum of its proper divisors (962183601).
2164913073 is a wasteful number, since it uses less digits than its factorization.
2164913073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240545903 (or 240545900 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 36.
The square root of 2164913073 is about 46528.6263820457. The cubic root of 2164913073 is about 1293.6401547291.
The spelling of 2164913073 in words is "two billion, one hundred sixty-four million, nine hundred thirteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •