Base | Representation |
---|---|
bin | 1001110101011110… |
… | …1100100001110001 |
3 | 20211000001211000000 |
4 | 2131113230201301 |
5 | 20401400001414 |
6 | 1113553220213 |
7 | 122266423665 |
oct | 23527544161 |
9 | 6730054000 |
10 | 2640234609 |
11 | 1135386381 |
12 | 618261669 |
13 | 330cbc4cc |
14 | 1b09168a5 |
15 | 106bcbb09 |
hex | 9d5ec871 |
2640234609 has 14 divisors (see below), whose sum is σ = 3958542146. Its totient is φ = 1760155920.
The previous prime is 2640234599. The next prime is 2640234643. The reversal of 2640234609 is 9064320462.
2640234609 is a `hidden beast` number, since 2 + 6 + 40 + 2 + 3 + 4 + 609 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2245338225 + 394896384 = 47385^2 + 19872^2 .
It is not a de Polignac number, because 2640234609 - 24 = 2640234593 is a prime.
It is a super-2 number, since 2×26402346092 = 13941677581122765762, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2640234679) 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 in 13 ways as a sum of consecutive naturals, for example, 1810132 + ... + 1811589.
Almost surely, 22640234609 is an apocalyptic number.
It is an amenable number.
2640234609 is a deficient number, since it is larger than the sum of its proper divisors (1318307537).
2640234609 is an frugal number, since it uses more digits than its factorization.
2640234609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3621739 (or 3621724 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The square root of 2640234609 is about 51383.2132996760. The cubic root of 2640234609 is about 1382.1255853826.
The spelling of 2640234609 in words is "two billion, six hundred forty million, two hundred thirty-four thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •