Base | Representation |
---|---|
bin | 1001001101100001… |
… | …0101000000000000 |
3 | 20101022200112021010 |
4 | 2103120111000000 |
5 | 20030443100344 |
6 | 1045205000520 |
7 | 115162664433 |
oct | 22330250000 |
9 | 6338615233 |
10 | 2472628224 |
11 | 1059809200 |
12 | 5900b3140 |
13 | 305367831 |
14 | 19656781a |
15 | e71208b9 |
hex | 93615000 |
2472628224 has 156 divisors (see below), whose sum is σ = 7251066368. Its totient is φ = 748830720.
The previous prime is 2472628211. The next prime is 2472628243. The reversal of 2472628224 is 4228262742.
It is a super-3 number, since 3×24726282243 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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, 1486017 + ... + 1487679.
Almost surely, 22472628224 is an apocalyptic number.
2472628224 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2472628224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3625533184).
2472628224 is an abundant number, since it is smaller than the sum of its proper divisors (4778438144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2472628224 is a wasteful number, since it uses less digits than its factorization.
2472628224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1712 (or 1679 counting only the distinct ones).
The product of its digits is 172032, while the sum is 39.
The square root of 2472628224 is about 49725.5288961314. The cubic root of 2472628224 is about 1352.2373916449.
The spelling of 2472628224 in words is "two billion, four hundred seventy-two million, six hundred twenty-eight thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •