Base | Representation |
---|---|
bin | 111101100001001… |
… | …1001000101000100 |
3 | 12022212012110210020 |
4 | 1323002121011010 |
5 | 13211420141310 |
6 | 540455255140 |
7 | 102103422315 |
oct | 17302310504 |
9 | 5285173706 |
10 | 2064224580 |
11 | 96a223530 |
12 | 49737a4b0 |
13 | 26b873182 |
14 | 15821660c |
15 | c134c170 |
hex | 7b099144 |
2064224580 has 48 divisors (see below), whose sum is σ = 6305269824. Its totient is φ = 500417920.
The previous prime is 2064224579. The next prime is 2064224593. The reversal of 2064224580 is 854224602.
It is a super-2 number, since 2×20642245802 = 8522046233352352800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1563147 + ... + 1564466.
It is an arithmetic number, because the mean of its divisors is an integer number (131359788).
Almost surely, 22064224580 is an apocalyptic number.
2064224580 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2064224580 is an abundant number, since it is smaller than the sum of its proper divisors (4241045244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064224580 is a wasteful number, since it uses less digits than its factorization.
2064224580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3127636 (or 3127634 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 33.
The square root of 2064224580 is about 45433.7383449788. The cubic root of 2064224580 is about 1273.2655292849.
The spelling of 2064224580 in words is "two billion, sixty-four million, two hundred twenty-four thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •