Base | Representation |
---|---|
bin | 10010101110001011… |
… | …000100001101110000 |
3 | 1220212221110200122112 |
4 | 102232023010031300 |
5 | 312132103134431 |
6 | 13122411424452 |
7 | 1311101141240 |
oct | 225613041560 |
9 | 56787420575 |
10 | 20102005616 |
11 | 8586070390 |
12 | 3a90155128 |
13 | 1b848712a4 |
14 | d89a79b20 |
15 | 7c9bb9c2b |
hex | 4ae2c4370 |
20102005616 has 80 divisors (see below), whose sum is σ = 48912940800. Its totient is φ = 7774717440.
The previous prime is 20102005571. The next prime is 20102005619. The reversal of 20102005616 is 61650020102.
It is a junction number, because it is equal to n+sod(n) for n = 20102005591 and 20102005600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102005619) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109235 + ... + 228333.
It is an arithmetic number, because the mean of its divisors is an integer number (611411760).
Almost surely, 220102005616 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 20102005616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24456470400).
20102005616 is an abundant number, since it is smaller than the sum of its proper divisors (28810935184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20102005616 is a wasteful number, since it uses less digits than its factorization.
20102005616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119262 (or 119256 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 20102005616 its reverse (61650020102), we get a palindrome (81752025718).
The spelling of 20102005616 in words is "twenty billion, one hundred two million, five thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •