Base | Representation |
---|---|
bin | 101111110001100001001110… |
… | …101110110010110111001000 |
3 | 1000112221102112021122111120012 |
4 | 233301201032232302313020 |
5 | 210014430033434310440 |
6 | 2022511414431251052 |
7 | 62154012306662501 |
oct | 5761411656626710 |
9 | 1015842467574505 |
10 | 210111121010120 |
11 | 60a47698251a20 |
12 | 1b694b39379a88 |
13 | 9031516c400a5 |
14 | 39c560ab83ba8 |
15 | 1945714710e65 |
hex | bf184ebb2dc8 |
210111121010120 has 32 divisors (see below), whose sum is σ = 515727297025920. Its totient is φ = 76404044003520.
The previous prime is 210111121010117. The next prime is 210111121010149. The reversal of 210111121010120 is 21010121111012.
It is a junction number, because it is equal to n+sod(n) for n = 210111121010095 and 210111121010104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 238762637072 + ... + 238762637951.
It is an arithmetic number, because the mean of its divisors is an integer number (16116478032060).
Almost surely, 2210111121010120 is an apocalyptic number.
210111121010120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210111121010120 is an abundant number, since it is smaller than the sum of its proper divisors (305616176015800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210111121010120 is a wasteful number, since it uses less digits than its factorization.
210111121010120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 477525275045 (or 477525275041 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 210111121010120 its reverse (21010121111012), we get a palindrome (231121242121132).
The spelling of 210111121010120 in words is "two hundred ten trillion, one hundred eleven billion, one hundred twenty-one million, ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •