Base | Representation |
---|---|
bin | 10011101011000110… |
… | …011011111011111000 |
3 | 2000112011220122210110 |
4 | 103223012123323320 |
5 | 321230243432412 |
6 | 13412044544320 |
7 | 1345322520300 |
oct | 235306337370 |
9 | 60464818713 |
10 | 21124202232 |
11 | 8a60074881 |
12 | 41165520a0 |
13 | 1cb8580663 |
14 | 1045724600 |
15 | 8397d2d3c |
hex | 4eb19bef8 |
21124202232 has 96 divisors (see below), whose sum is σ = 61629973200. Its totient is φ = 6016098816.
The previous prime is 21124202221. The next prime is 21124202233. The reversal of 21124202232 is 23220242112.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 21124202199 and 21124202208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21124202233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 339394 + ... + 396782.
Almost surely, 221124202232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21124202232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30814986600).
21124202232 is an abundant number, since it is smaller than the sum of its proper divisors (40505770968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21124202232 is a wasteful number, since it uses less digits than its factorization.
21124202232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57725 (or 57714 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 21124202232 its reverse (23220242112), we get a palindrome (44344444344).
The spelling of 21124202232 in words is "twenty-one billion, one hundred twenty-four million, two hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •