Base | Representation |
---|---|
bin | 1001000111010101101100… |
… | …10110000111111000000000 |
3 | 2121222010110101021221012211 |
4 | 10203222312112013320000 |
5 | 10111342313410441442 |
6 | 110343444454231504 |
7 | 4136041362352303 |
oct | 443526626077000 |
9 | 77863411257184 |
10 | 20043376655872 |
11 | 6428391657669 |
12 | 22b865a355594 |
13 | b2510baa780b |
14 | 4d416707ab3a |
15 | 24b593013617 |
hex | 123ab6587e00 |
20043376655872 has 160 divisors (see below), whose sum is σ = 41668488180000. Its totient is φ = 9620226932736.
The previous prime is 20043376655851. The next prime is 20043376655891. The reversal of 20043376655872 is 27855667334002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2032998079 + ... + 2033007937.
It is an arithmetic number, because the mean of its divisors is an integer number (260428051125).
Almost surely, 220043376655872 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 20043376655872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20834244090000).
20043376655872 is an abundant number, since it is smaller than the sum of its proper divisors (21625111524128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20043376655872 is an equidigital number, since it uses as much as digits as its factorization.
20043376655872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10684 (or 10668 counting only the distinct ones).
The product of its (nonzero) digits is 50803200, while the sum is 58.
The spelling of 20043376655872 in words is "twenty trillion, forty-three billion, three hundred seventy-six million, six hundred fifty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •