Base | Representation |
---|---|
bin | 10011100110010001… |
… | …100011111001100000 |
3 | 2000022112112222000000 |
4 | 103212101203321200 |
5 | 321044031413402 |
6 | 13400033300000 |
7 | 1343320344432 |
oct | 234621437140 |
9 | 60275488000 |
10 | 21043232352 |
11 | 8a193a0a1a |
12 | 40b3404600 |
13 | 1ca487099c |
14 | 1038a88652 |
15 | 83263bc1c |
hex | 4e6463e60 |
21043232352 has 168 divisors, whose sum is σ = 62245781640. Its totient is φ = 6999644160.
The previous prime is 21043232321. The next prime is 21043232389. The reversal of 21043232352 is 25323234012.
21043232352 is a `hidden beast` number, since 2 + 104 + 323 + 235 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 21671227 + ... + 21672197.
It is an arithmetic number, because the mean of its divisors is an integer number (370510605).
Almost surely, 221043232352 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 21043232352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31122890820).
21043232352 is an abundant number, since it is smaller than the sum of its proper divisors (41202549288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21043232352 is an frugal number, since it uses more digits than its factorization.
21043232352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1928 (or 1905 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 21043232352 its reverse (25323234012), we get a palindrome (46366466364).
The spelling of 21043232352 in words is "twenty-one billion, forty-three million, two hundred thirty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •