Base | Representation |
---|---|
bin | 10110111100000111… |
… | …000111110111100000 |
3 | 2100120120020022111110 |
4 | 112330013013313200 |
5 | 400420442222240 |
6 | 15152031543320 |
7 | 1531242342531 |
oct | 267407076740 |
9 | 70516208443 |
10 | 24630820320 |
11 | a49a501957 |
12 | 493498ab40 |
13 | 2426bc63c2 |
14 | 1299326688 |
15 | 99259ac80 |
hex | 5bc1c7de0 |
24630820320 has 96 divisors (see below), whose sum is σ = 77614588800. Its totient is φ = 6565890560.
The previous prime is 24630820289. The next prime is 24630820337. The reversal of 24630820320 is 2302803642.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×246308203202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1668331 + ... + 1683029.
It is an arithmetic number, because the mean of its divisors is an integer number (808485300).
Almost surely, 224630820320 is an apocalyptic number.
24630820320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
24630820320 is an abundant number, since it is smaller than the sum of its proper divisors (52983768480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24630820320 is a wasteful number, since it uses less digits than its factorization.
24630820320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18208 (or 18200 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
The spelling of 24630820320 in words is "twenty-four billion, six hundred thirty million, eight hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •