Base | Representation |
---|---|
bin | 1010000001011101000110… |
… | …1111110111101010000010 |
3 | 1110000111211102100122220111 |
4 | 2200113101233313222002 |
5 | 2421023141141213442 |
6 | 35234322500501534 |
7 | 2215114413212623 |
oct | 240272157675202 |
9 | 43014742318814 |
10 | 11020110101122 |
11 | 35696699495a1 |
12 | 129b9306aa8aa |
13 | 61c26586b085 |
14 | 2a153a31ba4a |
15 | 1419d1e22b17 |
hex | a05d1bf7a82 |
11020110101122 has 8 divisors (see below), whose sum is σ = 16530378651900. Its totient is φ = 5509983883824.
The previous prime is 11020110101069. The next prime is 11020110101123. The reversal of 11020110101122 is 22110101102011.
It is a happy number.
11020110101122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10471430649681 + 548679451441 = 3235959^2 + 740729^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110201101011222 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11020110101123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35389597 + ... + 35699632.
Almost surely, 211020110101122 is an apocalyptic number.
11020110101122 is a deficient number, since it is larger than the sum of its proper divisors (5510268550778).
11020110101122 is an equidigital number, since it uses as much as digits as its factorization.
11020110101122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71166740.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11020110101122 its reverse (22110101102011), we get a palindrome (33130211203133).
The spelling of 11020110101122 in words is "eleven trillion, twenty billion, one hundred ten million, one hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •