Base | Representation |
---|---|
bin | 10011010110011001… |
… | …011110110001011010 |
3 | 1222121222100111201200 |
4 | 103112121132301122 |
5 | 320022334414200 |
6 | 13313400255030 |
7 | 1333604335623 |
oct | 232631366132 |
9 | 58558314650 |
10 | 20776873050 |
11 | 88a200426a |
12 | 403a171476 |
13 | 1c6162102b |
14 | 1011550a4a |
15 | 819075800 |
hex | 4d665ec5a |
20776873050 has 72 divisors (see below), whose sum is σ = 56019522780. Its totient is φ = 5520748800.
The previous prime is 20776873043. The next prime is 20776873067. The reversal of 20776873050 is 5037867702.
It can be written as a sum of positive squares in 6 ways, for example, as 2720769921 + 18056103129 = 52161^2 + 134373^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 20776872987 and 20776873005.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 44296 + ... + 208604.
Almost surely, 220776873050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20776873050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28009761390).
20776873050 is an abundant number, since it is smaller than the sum of its proper divisors (35242649730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20776873050 is a wasteful number, since it uses less digits than its factorization.
20776873050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164608 (or 164600 counting only the distinct ones).
The product of its (nonzero) digits is 493920, while the sum is 45.
The spelling of 20776873050 in words is "twenty billion, seven hundred seventy-six million, eight hundred seventy-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •