Base | Representation |
---|---|
bin | 10110011110111010… |
… | …111111101111001110 |
3 | 2022022102202001022000 |
4 | 112132322333233032 |
5 | 343420110231110 |
6 | 15031255333130 |
7 | 1513144660443 |
oct | 263672775716 |
9 | 68272661260 |
10 | 24141102030 |
11 | a2690282a1 |
12 | 48189811a6 |
13 | 2379601176 |
14 | 12502899ca |
15 | 9645b41c0 |
hex | 59eebfbce |
24141102030 has 128 divisors (see below), whose sum is σ = 65318400000. Its totient is φ = 6343743744.
The previous prime is 24141101987. The next prime is 24141102091. The reversal of 24141102030 is 3020114142.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 24141101994 and 24141102012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17255271 + ... + 17256669.
It is an arithmetic number, because the mean of its divisors is an integer number (510300000).
Almost surely, 224141102030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 24141102030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32659200000).
24141102030 is an abundant number, since it is smaller than the sum of its proper divisors (41177297970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24141102030 is a wasteful number, since it uses less digits than its factorization.
24141102030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2303 (or 2297 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 24141102030 its reverse (3020114142), we get a palindrome (27161216172).
The spelling of 24141102030 in words is "twenty-four billion, one hundred forty-one million, one hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •