Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0011111111000010100111 |
3 | 1102222120022020021211200111 |
4 | 2200032010103333002213 |
5 | 2420342413034323421 |
6 | 35230005315153451 |
7 | 2214314353302460 |
oct | 240160423770247 |
9 | 42876266254614 |
10 | 11010221011111 |
11 | 35654547a7933 |
12 | 1299a308a5887 |
13 | 61b34ab4421a |
14 | 2a0c7cbc9d67 |
15 | 141603b71ee1 |
hex | a03844ff0a7 |
11010221011111 has 8 divisors (see below), whose sum is σ = 12850835466240. Its totient is φ = 9236537990808.
The previous prime is 11010221011067. The next prime is 11010221011147. The reversal of 11010221011111 is 11111012201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010221011111 - 229 = 11009684140199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11010221011091 and 11010221011100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010221011171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16732858351 + ... + 16732859008.
It is an arithmetic number, because the mean of its divisors is an integer number (1606354433280).
Almost surely, 211010221011111 is an apocalyptic number.
11010221011111 is a deficient number, since it is larger than the sum of its proper divisors (1840614455129).
11010221011111 is an equidigital number, since it uses as much as digits as its factorization.
11010221011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33465717413.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11010221011111 its reverse (11111012201011), we get a palindrome (22121233212122).
The spelling of 11010221011111 in words is "eleven trillion, ten billion, two hundred twenty-one million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •