Base | Representation |
---|---|
bin | 111101100010000… |
… | …0100011101111000 |
3 | 12022220000211011100 |
4 | 1323010010131320 |
5 | 13212023230230 |
6 | 540512531400 |
7 | 102110233566 |
oct | 17304043570 |
9 | 5286024140 |
10 | 2064664440 |
11 | 96a4a3a53 |
12 | 497550b60 |
13 | 26b998447 |
14 | 1582cca36 |
15 | c13d7660 |
hex | 7b104778 |
2064664440 has 48 divisors (see below), whose sum is σ = 6710160600. Its totient is φ = 550577088.
The previous prime is 2064664379. The next prime is 2064664463. The reversal of 2064664440 is 444664602.
It is a happy number.
2064664440 is a `hidden beast` number, since 2 + 0 + 6 + 4 + 6 + 644 + 4 + 0 = 666.
It is a super-5 number, since 5×20646644405 (a number of 48 digits) contains 55555 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2064664395 and 2064664404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2867230 + ... + 2867949.
Almost surely, 22064664440 is an apocalyptic number.
2064664440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2064664440 is an abundant number, since it is smaller than the sum of its proper divisors (4645496160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064664440 is a wasteful number, since it uses less digits than its factorization.
2064664440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5735196 (or 5735189 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 36.
The square root of 2064664440 is about 45438.5787629851. The cubic root of 2064664440 is about 1273.3559617578.
The spelling of 2064664440 in words is "two billion, sixty-four million, six hundred sixty-four thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •