Base | Representation |
---|---|
bin | 101111110001100001000111… |
… | …100001001011101001100010 |
3 | 1000112221102012211221121102110 |
4 | 233301201013201023221202 |
5 | 210014424312000013442 |
6 | 2022511354425500150 |
7 | 62154006310266543 |
oct | 5761410741135142 |
9 | 1015842184847373 |
10 | 210111000001122 |
11 | 60a47635a11090 |
12 | 1b694b04941656 |
13 | 90314c7b51b2c |
14 | 39c55d8a844ca |
15 | 1945708cab69c |
hex | bf184784ba62 |
210111000001122 has 64 divisors (see below), whose sum is σ = 491284004834304. Its totient is φ = 59255746165440.
The previous prime is 210111000001087. The next prime is 210111000001169. The reversal of 210111000001122 is 221100000111012.
It is a junction number, because it is equal to n+sod(n) for n = 210111000001098 and 210111000001107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1870390368 + ... + 1870502699.
It is an arithmetic number, because the mean of its divisors is an integer number (7676312575536).
Almost surely, 2210111000001122 is an apocalyptic number.
210111000001122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210111000001122 is an abundant number, since it is smaller than the sum of its proper divisors (281173004833182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210111000001122 is a wasteful number, since it uses less digits than its factorization.
210111000001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3740893143.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210111000001122 its reverse (221100000111012), we get a palindrome (431211000112134).
The spelling of 210111000001122 in words is "two hundred ten trillion, one hundred eleven billion, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •