Base | Representation |
---|---|
bin | 10100100001101100… |
… | …11011101111110001 |
3 | 1001110000022020222012 |
4 | 22100312123233301 |
5 | 140032122414441 |
6 | 5021303252305 |
7 | 540042333560 |
oct | 122066335761 |
9 | 31400266865 |
10 | 11020123121 |
11 | 4745632677 |
12 | 217674a095 |
13 | 1068151b17 |
14 | 76782bbd7 |
15 | 4477169eb |
hex | 290d9bbf1 |
11020123121 has 12 divisors (see below), whose sum is σ = 12694506048. Its totient is φ = 9371347272.
The previous prime is 11020123117. The next prime is 11020123171. The reversal of 11020123121 is 12132102011.
It is not a de Polignac number, because 11020123121 - 22 = 11020123117 is a prime.
It is a super-2 number, since 2×110201231212 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11020123096 and 11020123105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020123171) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 64100 + ... + 161706.
It is an arithmetic number, because the mean of its divisors is an integer number (1057875504).
Almost surely, 211020123121 is an apocalyptic number.
It is an amenable number.
11020123121 is a deficient number, since it is larger than the sum of its proper divisors (1674382927).
11020123121 is an frugal number, since it uses more digits than its factorization.
11020123121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97868 (or 97741 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11020123121 its reverse (12132102011), we get a palindrome (23152225132).
The spelling of 11020123121 in words is "eleven billion, twenty million, one hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •