Base | Representation |
---|---|
bin | 10010101000010101… |
… | …110000100101110100 |
3 | 1220122010022212211200 |
4 | 102220111300211310 |
5 | 311432030124044 |
6 | 13104554132500 |
7 | 1305502300656 |
oct | 225025604564 |
9 | 56563285750 |
10 | 20004145524 |
11 | 8535900680 |
12 | 3a63421130 |
13 | 1b6a4c97cc |
14 | d7aa846d6 |
15 | 7c12d9369 |
hex | 4a8570974 |
20004145524 has 144 divisors (see below), whose sum is σ = 56616356160. Its totient is φ = 5903838720.
The previous prime is 20004145523. The next prime is 20004145529. The reversal of 20004145524 is 42554140002.
20004145524 is a `hidden beast` number, since 200 + 0 + 4 + 1 + 455 + 2 + 4 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20004145523) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2913904 + ... + 2920760.
It is an arithmetic number, because the mean of its divisors is an integer number (393169140).
Almost surely, 220004145524 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 20004145524, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28308178080).
20004145524 is an abundant number, since it is smaller than the sum of its proper divisors (36612210636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20004145524 is a wasteful number, since it uses less digits than its factorization.
20004145524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7070 (or 7065 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 27.
Adding to 20004145524 its reverse (42554140002), we get a palindrome (62558285526).
The spelling of 20004145524 in words is "twenty billion, four million, one hundred forty-five thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •