Base | Representation |
---|---|
bin | 1001110101011011… |
… | …0100111111111001 |
3 | 20210222122021000000 |
4 | 2131112310333321 |
5 | 20401320212121 |
6 | 1113544303213 |
7 | 122264455611 |
oct | 23526647771 |
9 | 6728567000 |
10 | 2640007161 |
11 | 1135240500 |
12 | 618171b09 |
13 | 330c3cb1c |
14 | 1b0897a41 |
15 | 106b84526 |
hex | 9d5b4ff9 |
2640007161 has 63 divisors (see below), whose sum is σ = 4376043007. Its totient is φ = 1590755760.
The previous prime is 2640007121. The next prime is 2640007177. The reversal of 2640007161 is 1617000462.
The square root of 2640007161 is 51381.
It is a perfect power (a square), and thus also a powerful number.
2640007161 is a `hidden beast` number, since 2 + 640 + 0 + 0 + 7 + 16 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2401490025 + 238517136 = 49005^2 + 15444^2 .
It is not a de Polignac number, because 2640007161 - 217 = 2639876089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2640007121) by changing a digit.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 15260071 + ... + 15260243.
Almost surely, 22640007161 is an apocalyptic number.
2640007161 is the 51381-st square number.
2640007161 is the 25691-st centered octagonal number.
It is an amenable number.
2640007161 is a deficient number, since it is larger than the sum of its proper divisors (1736035846).
2640007161 is an frugal number, since it uses more digits than its factorization.
2640007161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386 (or 187 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The cubic root of 2640007161 is about 1382.0858956360.
The spelling of 2640007161 in words is "two billion, six hundred forty million, seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •