Base | Representation |
---|---|
bin | 1001000110000101010011… |
… | …00010011100101100101000 |
3 | 2121211000001011120211001010 |
4 | 10203002221202130230220 |
5 | 10110140413300010440 |
6 | 110311545352223520 |
7 | 4132652620644504 |
oct | 443025142345450 |
9 | 77730034524033 |
10 | 20000212110120 |
11 | 6411051371560 |
12 | 22b021269aba0 |
13 | b2102021b198 |
14 | 4d20304b3304 |
15 | 24a3b87d3580 |
hex | 1230a989cb28 |
20000212110120 has 64 divisors (see below), whose sum is σ = 65455239637440. Its totient is φ = 4848536268800.
The previous prime is 20000212110107. The next prime is 20000212110143. The reversal of 20000212110120 is 2101121200002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 20000212110096 and 20000212110105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7575836601 + ... + 7575839240.
It is an arithmetic number, because the mean of its divisors is an integer number (1022738119335).
Almost surely, 220000212110120 is an apocalyptic number.
20000212110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20000212110120 is an abundant number, since it is smaller than the sum of its proper divisors (45455027527320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000212110120 is a wasteful number, since it uses less digits than its factorization.
20000212110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15151675866 (or 15151675862 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20000212110120 its reverse (2101121200002), we get a palindrome (22101333310122).
The spelling of 20000212110120 in words is "twenty trillion, two hundred twelve million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •