Base | Representation |
---|---|
bin | 101111110000000011001010… |
… | …101010110000011001010000 |
3 | 1000112120202211102112000202012 |
4 | 233300003022222300121100 |
5 | 210011301212001023440 |
6 | 2022353152345042052 |
7 | 62143505402003531 |
oct | 5760031252603120 |
9 | 1015522742460665 |
10 | 210010121111120 |
11 | 60a08879461a10 |
12 | 1b679450786328 |
13 | 9024b3c22a445 |
14 | 39c0789000688 |
15 | 1942ca2814e65 |
hex | bf00caab0650 |
210010121111120 has 80 divisors (see below), whose sum is σ = 538153395853248. Its totient is φ = 75580024811520.
The previous prime is 210010121111111. The next prime is 210010121111143. The reversal of 210010121111120 is 21111121010012.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 210010121111095 and 210010121111104.
It is a congruent number.
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, 1230058274 + ... + 1230228993.
Almost surely, 2210010121111120 is an apocalyptic number.
210010121111120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210010121111120 is an abundant number, since it is smaller than the sum of its proper divisors (328143274742128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010121111120 is a wasteful number, since it uses less digits than its factorization.
210010121111120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2460287388 (or 2460287382 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 210010121111120 its reverse (21111121010012), we get a palindrome (231121242121132).
The spelling of 210010121111120 in words is "two hundred ten trillion, ten billion, one hundred twenty-one million, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •