Base | Representation |
---|---|
bin | 10010101100011011… |
… | …001000110011011010 |
3 | 1220210220020222220110 |
4 | 102230123020303122 |
5 | 312102100224112 |
6 | 13115442505150 |
7 | 1310263555056 |
oct | 225433106332 |
9 | 56726228813 |
10 | 20072664282 |
11 | 857054a850 |
12 | 3a823651b6 |
13 | 1b7b76a058 |
14 | d85bdcc66 |
15 | 7c732113c |
hex | 4ac6c8cda |
20072664282 has 64 divisors (see below), whose sum is σ = 46277775360. Its totient is φ = 5744481600.
The previous prime is 20072664229. The next prime is 20072664299. The reversal of 20072664282 is 28246627002.
It is a self number, because there is not a number n which added to its sum of digits gives 20072664282.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36232 + ... + 203612.
It is an arithmetic number, because the mean of its divisors is an integer number (723090240).
Almost surely, 220072664282 is an apocalyptic number.
20072664282 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 20072664282, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23138887680).
20072664282 is an abundant number, since it is smaller than the sum of its proper divisors (26205111078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20072664282 is a wasteful number, since it uses less digits than its factorization.
20072664282 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167499.
The product of its (nonzero) digits is 129024, while the sum is 39.
The spelling of 20072664282 in words is "twenty billion, seventy-two million, six hundred sixty-four thousand, two hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •