Base | Representation |
---|---|
bin | 1001100011111111011111… |
… | …00010111110010100000000 |
3 | 2202110020122101020121011100 |
4 | 10301333233202332110000 |
5 | 10224010101230233142 |
6 | 112420024304014400 |
7 | 4300133364333246 |
oct | 461775742762400 |
9 | 82406571217140 |
10 | 21027883836672 |
11 | 677796a259149 |
12 | 2437417901400 |
13 | b96bc83b77cb |
14 | 529a7da56796 |
15 | 266eb4569b4c |
hex | 131fef8be500 |
21027883836672 has 216 divisors, whose sum is σ = 61499873635200. Its totient is φ = 6908863463424.
The previous prime is 21027883836643. The next prime is 21027883836703. The reversal of 21027883836672 is 27663838872012.
21027883836672 is a `hidden beast` number, since 2 + 102 + 7 + 88 + 383 + 6 + 6 + 72 = 666.
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, 107838079 + ... + 108032897.
It is an arithmetic number, because the mean of its divisors is an integer number (284721637200).
Almost surely, 221027883836672 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 21027883836672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30749936817600).
21027883836672 is an abundant number, since it is smaller than the sum of its proper divisors (40471989798528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21027883836672 is a wasteful number, since it uses less digits than its factorization.
21027883836672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195513 (or 195496 counting only the distinct ones).
The product of its (nonzero) digits is 65028096, while the sum is 63.
The spelling of 21027883836672 in words is "twenty-one trillion, twenty-seven billion, eight hundred eighty-three million, eight hundred thirty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •