Base | Representation |
---|---|
bin | 10011000010011101… |
… | …101100101001100000 |
3 | 1221202200001020210112 |
4 | 103002131230221200 |
5 | 313331230343034 |
6 | 13220252150452 |
7 | 1322403552236 |
oct | 230235545140 |
9 | 57680036715 |
10 | 20442434144 |
11 | 8740248380 |
12 | 3b66168428 |
13 | 1c0a2559a2 |
14 | dbcd74956 |
15 | 7e9a127ce |
hex | 4c276ca60 |
20442434144 has 24 divisors (see below), whose sum is σ = 43904774088. Its totient is φ = 9292015360.
The previous prime is 20442434137. The next prime is 20442434147. The reversal of 20442434144 is 44143424402.
It is a super-2 number, since 2×204424341442 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 20442434144.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20442434147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29037197 + ... + 29037900.
It is an arithmetic number, because the mean of its divisors is an integer number (1829365587).
Almost surely, 220442434144 is an apocalyptic number.
It is an amenable number.
20442434144 is an abundant number, since it is smaller than the sum of its proper divisors (23462339944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20442434144 is a wasteful number, since it uses less digits than its factorization.
20442434144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58075118 (or 58075110 counting only the distinct ones).
The product of its (nonzero) digits is 49152, while the sum is 32.
Adding to 20442434144 its reverse (44143424402), we get a palindrome (64585858546).
The spelling of 20442434144 in words is "twenty billion, four hundred forty-two million, four hundred thirty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.743 sec. • engine limits •