Base | Representation |
---|---|
bin | 11001000011101001101110… |
… | …010110010011000111110101 |
3 | 112110012012221101011102012000 |
4 | 121003221232112103013311 |
5 | 103421022421242020041 |
6 | 1030214053412245513 |
7 | 32132561215164126 |
oct | 3103515626230765 |
9 | 473165841142160 |
10 | 110202122220021 |
11 | 32128504036737 |
12 | 10439aab910899 |
13 | 496502818b210 |
14 | 1d2db4dc1404d |
15 | cb192413cbb6 |
hex | 643a6e5931f5 |
110202122220021 has 32 divisors (see below), whose sum is σ = 175944088320000. Its totient is φ = 67769232842304.
The previous prime is 110202122220013. The next prime is 110202122220137. The reversal of 110202122220021 is 120022221202011.
It is a happy number.
It is not a de Polignac number, because 110202122220021 - 23 = 110202122220013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110202122219976 and 110202122220003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110202122220221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 109353621 + ... + 110356778.
It is an arithmetic number, because the mean of its divisors is an integer number (5498252760000).
Almost surely, 2110202122220021 is an apocalyptic number.
It is an amenable number.
110202122220021 is a deficient number, since it is larger than the sum of its proper divisors (65741966099979).
110202122220021 is a wasteful number, since it uses less digits than its factorization.
110202122220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219711850 (or 219711844 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 110202122220021 its reverse (120022221202011), we get a palindrome (230224343422032).
The spelling of 110202122220021 in words is "one hundred ten trillion, two hundred two billion, one hundred twenty-two million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •