Base | Representation |
---|---|
bin | 10110100011101000… |
… | …00011110110110100 |
3 | 1011020222010202110000 |
4 | 23101310003312310 |
5 | 144300131120040 |
6 | 5321355431300 |
7 | 606045320550 |
oct | 132164036664 |
9 | 34228122400 |
10 | 12110020020 |
11 | 515487730a |
12 | 241b755530 |
13 | 11acba6027 |
14 | 82c49a860 |
15 | 4ad254130 |
hex | 2d1d03db4 |
12110020020 has 120 divisors (see below), whose sum is σ = 43416705024. Its totient is φ = 2768001984.
The previous prime is 12110019991. The next prime is 12110020033. The reversal of 12110020020 is 2002001121.
12110020020 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12110019984 and 12110020011.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 522612 + ... + 545291.
Almost surely, 212110020020 is an apocalyptic number.
12110020020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12110020020 is an abundant number, since it is smaller than the sum of its proper divisors (31306685004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12110020020 is a wasteful number, since it uses less digits than its factorization.
12110020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1067931 (or 1067920 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 12110020020 its reverse (2002001121), we get a palindrome (14112021141).
The spelling of 12110020020 in words is "twelve billion, one hundred ten million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •