Base | Representation |
---|---|
bin | 11001010000101111110011… |
… | …110101110101010010011110 |
3 | 112120101020201002211012022212 |
4 | 121100233303311311102132 |
5 | 104030243404031133042 |
6 | 1032143320411040422 |
7 | 32254566244243646 |
oct | 3120576365652236 |
9 | 476336632735285 |
10 | 111102010021022 |
11 | 32445109262789 |
12 | 10564392440112 |
13 | 49cbb4a622087 |
14 | 1d6151a351526 |
15 | cca0418a5482 |
hex | 650bf3d7549e |
111102010021022 has 8 divisors (see below), whose sum is σ = 166653792066072. Its totient is φ = 55550745999000.
The previous prime is 111102010021019. The next prime is 111102010021039. The reversal of 111102010021022 is 220120010201111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1111020100210222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111102010020988 and 111102010021006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128969129 + ... + 129827732.
It is an arithmetic number, because the mean of its divisors is an integer number (20831724008259).
Almost surely, 2111102010021022 is an apocalyptic number.
111102010021022 is a deficient number, since it is larger than the sum of its proper divisors (55551782045050).
111102010021022 is a wasteful number, since it uses less digits than its factorization.
111102010021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259011514.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111102010021022 its reverse (220120010201111), we get a palindrome (331222020222133).
The spelling of 111102010021022 in words is "one hundred eleven trillion, one hundred two billion, ten million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •