Base | Representation |
---|---|
bin | 1001101001000100000001… |
… | …11001011011001001101010 |
3 | 2210001220101021102011201100 |
4 | 10310202000321123021222 |
5 | 10234333421001010442 |
6 | 113032041525302230 |
7 | 4315542216613311 |
oct | 464420071331152 |
9 | 83056337364640 |
10 | 21202121110122 |
11 | 68348506a05a7 |
12 | 2465143564976 |
13 | baa47516b094 |
14 | 53428c369278 |
15 | 26b7b0da884c |
hex | 134880e5b26a |
21202121110122 has 48 divisors (see below), whose sum is σ = 47987391404160. Its totient is φ = 6752740538016.
The previous prime is 21202121110109. The next prime is 21202121110139. The reversal of 21202121110122 is 22101112120212.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21202121110095 and 21202121110104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27482893 + ... + 28243824.
It is an arithmetic number, because the mean of its divisors is an integer number (999737320920).
Almost surely, 221202121110122 is an apocalyptic number.
21202121110122 is an abundant number, since it is smaller than the sum of its proper divisors (26785270294038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21202121110122 is a wasteful number, since it uses less digits than its factorization.
21202121110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55727667 (or 55727664 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 21202121110122 its reverse (22101112120212), we get a palindrome (43303233230334).
The spelling of 21202121110122 in words is "twenty-one trillion, two hundred two billion, one hundred twenty-one million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •