Base | Representation |
---|---|
bin | 101111110001100001000111… |
… | …101001001100010100011110 |
3 | 1000112221102012222220021221112 |
4 | 233301201013221030110132 |
5 | 210014424313014213042 |
6 | 2022511354542502022 |
7 | 62154006334163651 |
oct | 5761410751142436 |
9 | 1015842188807845 |
10 | 210111002101022 |
11 | 60a47637115840 |
12 | 1b694b05594912 |
13 | 90314c8408889 |
14 | 39c55d906d898 |
15 | 1945709073982 |
hex | bf1847a4c51e |
210111002101022 has 64 divisors (see below), whose sum is σ = 359640889574400. Its totient is φ = 91130078054400.
The previous prime is 210111002101009. The next prime is 210111002101031. The reversal of 210111002101022 is 220101200111012.
210111002101022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 210111002100988 and 210111002101006.
It is a congruent number.
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, 1113837872 + ... + 1114026492.
It is an arithmetic number, because the mean of its divisors is an integer number (5619388899600).
Almost surely, 2210111002101022 is an apocalyptic number.
210111002101022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210111002101022 is a deficient number, since it is larger than the sum of its proper divisors (149529887473378).
210111002101022 is a wasteful number, since it uses less digits than its factorization.
210111002101022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194009.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 210111002101022 its reverse (220101200111012), we get a palindrome (430212202212034).
The spelling of 210111002101022 in words is "two hundred ten trillion, one hundred eleven billion, two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •