Base | Representation |
---|---|
bin | 10100001011111100… |
… | …111011111100000000 |
3 | 2001221121000101010010 |
4 | 110023330323330000 |
5 | 323342343010000 |
6 | 13542454104520 |
7 | 1365064343250 |
oct | 241374737400 |
9 | 61847011103 |
10 | 21675360000 |
11 | 92131a2868 |
12 | 424b04b140 |
13 | 2075807b08 |
14 | 10989d5960 |
15 | 86cda3d50 |
hex | 50bf3bf00 |
21675360000 has 360 divisors, whose sum is σ = 82397924224. Its totient is φ = 4953600000.
The previous prime is 21675359963. The next prime is 21675360013. The reversal of 21675360000 is 6357612.
It is a super-2 number, since 2×216753600002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 21675360000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 3356775 + ... + 3363225.
Almost surely, 221675360000 is an apocalyptic number.
21675360000 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 21675360000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41198962112).
21675360000 is an abundant number, since it is smaller than the sum of its proper divisors (60722564224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21675360000 is an frugal number, since it uses more digits than its factorization.
21675360000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6497 (or 6468 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 30.
The spelling of 21675360000 in words is "twenty-one billion, six hundred seventy-five million, three hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •