Base | Representation |
---|---|
bin | 10110110110110000… |
… | …101100010100010110 |
3 | 2100100022022201120110 |
4 | 112312300230110112 |
5 | 400230002213410 |
6 | 15135103543450 |
7 | 1526102343030 |
oct | 266660542426 |
9 | 70308281513 |
10 | 24541054230 |
11 | a453870300 |
12 | 490a8bab86 |
13 | 2411426a84 |
14 | 128b43ac50 |
15 | 989768720 |
hex | 5b6c2c516 |
24541054230 has 192 divisors, whose sum is σ = 75566131200. Its totient is φ = 4990698240.
The previous prime is 24541054201. The next prime is 24541054247. The reversal of 24541054230 is 3245014542.
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 (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1183996 + ... + 1204544.
It is an arithmetic number, because the mean of its divisors is an integer number (393573600).
Almost surely, 224541054230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 24541054230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37783065600).
24541054230 is an abundant number, since it is smaller than the sum of its proper divisors (51025076970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24541054230 is a wasteful number, since it uses less digits than its factorization.
24541054230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20635 (or 20624 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 24541054230 its reverse (3245014542), we get a palindrome (27786068772).
The spelling of 24541054230 in words is "twenty-four billion, five hundred forty-one million, fifty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •