Base | Representation |
---|---|
bin | 1001001001011101011001… |
… | …00100011000100101111100 |
3 | 2122020002111110012020000122 |
4 | 10210232230210120211330 |
5 | 10114041013112104421 |
6 | 110441133411314112 |
7 | 4144230600544250 |
oct | 444565444304574 |
9 | 78202443166018 |
10 | 20116227066236 |
11 | 6456275828184 |
12 | 230a7ab8ab938 |
13 | b2bc4b91c502 |
14 | 4d78b847a260 |
15 | 24d4089ba2ab |
hex | 124bac91897c |
20116227066236 has 96 divisors (see below), whose sum is σ = 42624873863040. Its totient is φ = 8125288464384.
The previous prime is 20116227066193. The next prime is 20116227066239. The reversal of 20116227066236 is 63266072261102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116227066239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4000466 + ... + 7499078.
It is an arithmetic number, because the mean of its divisors is an integer number (444009102740).
Almost surely, 220116227066236 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 20116227066236, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21312436931520).
20116227066236 is an abundant number, since it is smaller than the sum of its proper divisors (22508646796804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20116227066236 is a wasteful number, since it uses less digits than its factorization.
20116227066236 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3498823 (or 3498821 counting only the distinct ones).
The product of its (nonzero) digits is 435456, while the sum is 44.
The spelling of 20116227066236 in words is "twenty trillion, one hundred sixteen billion, two hundred twenty-seven million, sixty-six thousand, two hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •