Base | Representation |
---|---|
bin | 10110100011001011… |
… | …100000101011000100 |
3 | 2022111102011110220110 |
4 | 112203023200223010 |
5 | 344041402240400 |
6 | 15042330433020 |
7 | 1515003123630 |
oct | 264313405304 |
9 | 68442143813 |
10 | 24212540100 |
11 | a2a5390821 |
12 | 4838892770 |
13 | 238b354408 |
14 | 1259963dc0 |
15 | 96a9c5e50 |
hex | 5a32e0ac4 |
24212540100 has 144 divisors (see below), whose sum is σ = 80302721408. Its totient is φ = 5517711360.
The previous prime is 24212540083. The next prime is 24212540101. The reversal of 24212540100 is 104521242.
It is a super-3 number, since 3×242125401003 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (24212540101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 690594 + ... + 724806.
Almost surely, 224212540100 is an apocalyptic number.
24212540100 is a gapful number since it is divisible by the number (20) 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 24212540100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40151360704).
24212540100 is an abundant number, since it is smaller than the sum of its proper divisors (56090181308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24212540100 is a wasteful number, since it uses less digits than its factorization.
24212540100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34574 (or 34567 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
The spelling of 24212540100 in words is "twenty-four billion, two hundred twelve million, five hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •