Base | Representation |
---|---|
bin | 1001000110000111000111… |
… | …10010011011000110110000 |
3 | 2121211002120021111002101201 |
4 | 10203003203302123012300 |
5 | 10110144413440021212 |
6 | 110312230342340544 |
7 | 4133016055402435 |
oct | 443034362330660 |
9 | 77732507432351 |
10 | 20001189376432 |
11 | 6411502a78170 |
12 | 22b0445a2a754 |
13 | b21147828884 |
14 | 4d20c41c3b8c |
15 | 24a4244c3b57 |
hex | 1230e3c9b1b0 |
20001189376432 has 80 divisors (see below), whose sum is σ = 42466029750144. Its totient is φ = 9050428544000.
The previous prime is 20001189376387. The next prime is 20001189376451. The reversal of 20001189376432 is 23467398110002.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
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, 479842632 + ... + 479884312.
Almost surely, 220001189376432 is an apocalyptic number.
20001189376432 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20001189376432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21233014875072).
20001189376432 is an abundant number, since it is smaller than the sum of its proper divisors (22464840373712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001189376432 is a wasteful number, since it uses less digits than its factorization.
20001189376432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53938 (or 53932 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 46.
The spelling of 20001189376432 in words is "twenty trillion, one billion, one hundred eighty-nine million, three hundred seventy-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •