Base | Representation |
---|---|
bin | 10011010110001101… |
… | …011110011000000000 |
3 | 1222121202102121101000 |
4 | 103112031132120000 |
5 | 320021033210241 |
6 | 13313205012000 |
7 | 1333535516643 |
oct | 232615363000 |
9 | 58552377330 |
10 | 20773725696 |
11 | 88a0254649 |
12 | 40390b4000 |
13 | 1c60a8b5a9 |
14 | 1010d71a5a |
15 | 818b52eb6 |
hex | 4d635e600 |
20773725696 has 320 divisors, whose sum is σ = 65308320000. Its totient is φ = 6501482496.
The previous prime is 20773725631. The next prime is 20773725697. The reversal of 20773725696 is 69652737702.
20773725696 is a `hidden beast` number, since 2 + 0 + 7 + 7 + 3 + 72 + 569 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20773725697) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36508900 + ... + 36509468.
It is an arithmetic number, because the mean of its divisors is an integer number (204088500).
Almost surely, 220773725696 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 20773725696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32654160000).
20773725696 is an abundant number, since it is smaller than the sum of its proper divisors (44534594304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20773725696 is a wasteful number, since it uses less digits than its factorization.
20773725696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754 (or 732 counting only the distinct ones).
The product of its (nonzero) digits is 6667920, while the sum is 54.
The spelling of 20773725696 in words is "twenty billion, seven hundred seventy-three million, seven hundred twenty-five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •