Base | Representation |
---|---|
bin | 10010101110110101… |
… | …110011110001000000 |
3 | 1220220201112221202201 |
4 | 102232311303301000 |
5 | 312142440213212 |
6 | 13123451522544 |
7 | 1311265316320 |
oct | 225665636100 |
9 | 56821487681 |
10 | 20113210432 |
11 | 8591423767 |
12 | 3a93a59454 |
13 | 1b86c95363 |
14 | d8b355280 |
15 | 7cab7eb57 |
hex | 4aed73c40 |
20113210432 has 56 divisors (see below), whose sum is σ = 45728046720. Its totient is φ = 8598374400.
The previous prime is 20113210417. The next prime is 20113210433. The reversal of 20113210432 is 23401231102.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (56).
It is not an unprimeable number, because it can be changed into a prime (20113210433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123669 + ... + 235627.
Almost surely, 220113210432 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 20113210432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22864023360).
20113210432 is an abundant number, since it is smaller than the sum of its proper divisors (25614836288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20113210432 is a wasteful number, since it uses less digits than its factorization.
20113210432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112379 (or 112369 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20113210432 its reverse (23401231102), we get a palindrome (43514441534).
The spelling of 20113210432 in words is "twenty billion, one hundred thirteen million, two hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •