Base | Representation |
---|---|
bin | 10100011111010100… |
… | …11110011100001011 |
3 | 1001101121211121222001 |
4 | 22033222132130023 |
5 | 140012023224321 |
6 | 5015312411431 |
7 | 536411152423 |
oct | 121752363413 |
9 | 31347747861 |
10 | 11000211211 |
11 | 4735372550 |
12 | 216bb46b77 |
13 | 1063c9c822 |
14 | 764d27483 |
15 | 445ad1c91 |
hex | 28fa9e70b |
11000211211 has 8 divisors (see below), whose sum is σ = 12000996144. Its totient is φ = 9999553920.
The previous prime is 11000211197. The next prime is 11000211319. The reversal of 11000211211 is 11211200011.
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 11000211211 - 27 = 11000211083 is a prime.
It is a super-2 number, since 2×110002112112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000251211) 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 7 ways as a sum of consecutive naturals, for example, 286335 + ... + 322471.
It is an arithmetic number, because the mean of its divisors is an integer number (1500124518).
Almost surely, 211000211211 is an apocalyptic number.
11000211211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11000211211 is a deficient number, since it is larger than the sum of its proper divisors (1000784933).
11000211211 is a wasteful number, since it uses less digits than its factorization.
11000211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63821.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11000211211 its reverse (11211200011), we get a palindrome (22211411222).
The spelling of 11000211211 in words is "eleven billion, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •