Base | Representation |
---|---|
bin | 10011000111010111… |
… | …000010010000000000 |
3 | 1221222101121101002011 |
4 | 103013113002100000 |
5 | 314013242324241 |
6 | 13232344502304 |
7 | 1324421666164 |
oct | 230727022000 |
9 | 57871541064 |
10 | 20524573696 |
11 | 8782650000 |
12 | 3b8977a994 |
13 | 1c21284b83 |
14 | dc9c36ca4 |
15 | 801d3a281 |
hex | 4c75c2400 |
20524573696 has 165 divisors, whose sum is σ = 46384477545. Its totient is φ = 9077207040.
The previous prime is 20524573649. The next prime is 20524573697. The reversal of 20524573696 is 69637542502.
The square root of 20524573696 is 143264.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 18365670400 + 2158903296 = 135520^2 + 46464^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20524573697) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 554718190 + ... + 554718226.
Almost surely, 220524573696 is an apocalyptic number.
20524573696 is the 143264-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20524573696
20524573696 is an abundant number, since it is smaller than the sum of its proper divisors (25859903849).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20524573696 is an frugal number, since it uses more digits than its factorization.
20524573696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138 (or 50 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 49.
Multiplying 20524573696 by its sum of digits (49), we get a square (1005704111104 = 10028482).
The spelling of 20524573696 in words is "twenty billion, five hundred twenty-four million, five hundred seventy-three thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •