Base | Representation |
---|---|
bin | 10011011000110001… |
… | …000010111111100000 |
3 | 1222201202010002221000 |
4 | 103120301002333200 |
5 | 320113022331102 |
6 | 13321340032000 |
7 | 1334566136640 |
oct | 233061027740 |
9 | 58652102830 |
10 | 20816605152 |
11 | 8912481612 |
12 | 404b532600 |
13 | 1c69922955 |
14 | 1016934520 |
15 | 81c7c301c |
hex | 4d8c42fe0 |
20816605152 has 192 divisors, whose sum is σ = 71627673600. Its totient is φ = 5755691520.
The previous prime is 20816605141. The next prime is 20816605153. The reversal of 20816605152 is 25150661802.
20816605152 is a `hidden beast` number, since 2 + 0 + 81 + 6 + 60 + 515 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20816605153) 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, 131974 + ... + 243002.
It is an arithmetic number, because the mean of its divisors is an integer number (373060800).
Almost surely, 220816605152 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 20816605152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35813836800).
20816605152 is an abundant number, since it is smaller than the sum of its proper divisors (50811068448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20816605152 is a wasteful number, since it uses less digits than its factorization.
20816605152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111086 (or 111072 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The spelling of 20816605152 in words is "twenty billion, eight hundred sixteen million, six hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •