Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011100001101110 |
3 | 1001102101100101200202 |
4 | 22100110003201232 |
5 | 140022321023042 |
6 | 5020342153502 |
7 | 536602620332 |
oct | 122024034156 |
9 | 31371311622 |
10 | 11011111022 |
11 | 474053775a |
12 | 2173722892 |
13 | 1066317b12 |
14 | 7665637c2 |
15 | 446a36632 |
hex | 29050386e |
11011111022 has 16 divisors (see below), whose sum is σ = 16611734880. Its totient is φ = 5473956768.
The previous prime is 11011111009. The next prime is 11011111031. The reversal of 11011111022 is 22011111011.
It is a junction number, because it is equal to n+sod(n) for n = 11011110994 and 11011111012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224303 + ... + 268949.
It is an arithmetic number, because the mean of its divisors is an integer number (1038233430).
Almost surely, 211011111022 is an apocalyptic number.
11011111022 is a deficient number, since it is larger than the sum of its proper divisors (5600623858).
11011111022 is a wasteful number, since it uses less digits than its factorization.
11011111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45355.
The product of its (nonzero) digits is 4, while the sum is 11.
Subtracting from 11011111022 its sum of digits (11), we obtain a palindrome (11011111011).
Adding to 11011111022 its reverse (22011111011), we get a palindrome (33022222033).
The spelling of 11011111022 in words is "eleven billion, eleven million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •