Base | Representation |
---|---|
bin | 1001101111100000111111… |
… | …10001110100010100000000 |
3 | 2210212002122112212000121121 |
4 | 10313300133301310110000 |
5 | 10302002000441303342 |
6 | 113321545513002024 |
7 | 4340551323400600 |
oct | 467603761642400 |
9 | 83762575760547 |
10 | 21423830025472 |
11 | 690a882593156 |
12 | 24a00b93b3314 |
13 | bc5348c133a4 |
14 | 540cc1698c00 |
15 | 27243a10e067 |
hex | 137c1fc74500 |
21423830025472 has 216 divisors, whose sum is σ = 52728189603264. Its totient is φ = 8632338333696.
The previous prime is 21423830025461. The next prime is 21423830025497. The reversal of 21423830025472 is 27452003832412.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 201892813 + ... + 201998899.
It is an arithmetic number, because the mean of its divisors is an integer number (244111988904).
Almost surely, 221423830025472 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 21423830025472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26364094801632).
21423830025472 is an abundant number, since it is smaller than the sum of its proper divisors (31304359577792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21423830025472 is a wasteful number, since it uses less digits than its factorization.
21423830025472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107081 (or 107060 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 43.
Adding to 21423830025472 its reverse (27452003832412), we get a palindrome (48875833857884).
The spelling of 21423830025472 in words is "twenty-one trillion, four hundred twenty-three billion, eight hundred thirty million, twenty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •