Base | Representation |
---|---|
bin | 101111110000000011010000… |
… | …000010000010110110101000 |
3 | 1000112120210001200212001012012 |
4 | 233300003100002002312220 |
5 | 210011301403020231440 |
6 | 2022353205321535052 |
7 | 62143510543631132 |
oct | 5760032002026650 |
9 | 1015523050761165 |
10 | 210010211102120 |
11 | 60a08915237540 |
12 | 1b679476944488 |
13 | 9024b54a78260 |
14 | 39c0796d48052 |
15 | 1942caa68de65 |
hex | bf00d0082da8 |
210010211102120 has 128 divisors (see below), whose sum is σ = 556722527760000. Its totient is φ = 70290951828480.
The previous prime is 210010211102071. The next prime is 210010211102171. The reversal of 210010211102120 is 21201112010012.
It is a junction number, because it is equal to n+sod(n) for n = 210010211102095 and 210010211102104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50604110 + ... + 54596669.
It is an arithmetic number, because the mean of its divisors is an integer number (4349394748125).
Almost surely, 2210010211102120 is an apocalyptic number.
210010211102120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210010211102120 is an abundant number, since it is smaller than the sum of its proper divisors (346712316657880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010211102120 is a wasteful number, since it uses less digits than its factorization.
210010211102120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105201163 (or 105201159 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210010211102120 its reverse (21201112010012), we get a palindrome (231211323112132).
The spelling of 210010211102120 in words is "two hundred ten trillion, ten billion, two hundred eleven million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •