Base | Representation |
---|---|
bin | 10010110000000001… |
… | …101011101000000000 |
3 | 1220222002222110011120 |
4 | 102300001223220000 |
5 | 312213033200112 |
6 | 13125442112240 |
7 | 1311626345433 |
oct | 226001535000 |
9 | 56862873146 |
10 | 20133100032 |
11 | 85a1679051 |
12 | 3a9a64b680 |
13 | 1b8b13a456 |
14 | d8dc5181a |
15 | 7cc7ace8c |
hex | 4b006ba00 |
20133100032 has 80 divisors (see below), whose sum is σ = 53771236992. Its totient is φ = 6694092800.
The previous prime is 20133100003. The next prime is 20133100037. The reversal of 20133100032 is 23000133102.
It is a junction number, because it is equal to n+sod(n) for n = 20133099984 and 20133100020.
It is not an unprimeable number, because it can be changed into a prime (20133100037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 599593 + ... + 632279.
Almost surely, 220133100032 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 20133100032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26885618496).
20133100032 is an abundant number, since it is smaller than the sum of its proper divisors (33638136960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20133100032 is an equidigital number, since it uses as much as digits as its factorization.
20133100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33109 (or 33093 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 20133100032 its reverse (23000133102), we get a palindrome (43133233134).
The spelling of 20133100032 in words is "twenty billion, one hundred thirty-three million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •