Base | Representation |
---|---|
bin | 10100011111010101… |
… | …10110110110101011 |
3 | 1001101122000201010202 |
4 | 22033222312312223 |
5 | 140012034424321 |
6 | 5015314502415 |
7 | 536412050111 |
oct | 121752666653 |
9 | 31348021122 |
10 | 11000311211 |
11 | 473543069a |
12 | 216bb94a0b |
13 | 10640061b6 |
14 | 764d51ab1 |
15 | 445b0170b |
hex | 28fab6dab |
11000311211 has 4 divisors (see below), whose sum is σ = 11000554800. Its totient is φ = 11000067624.
The previous prime is 11000311199. The next prime is 11000311241. The reversal of 11000311211 is 11211300011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11211300011 = 167 ⋅67133533.
It is a cyclic number.
It is not a de Polignac number, because 11000311211 - 214 = 11000294827 is a prime.
It is a super-3 number, since 3×110003112113 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000311192 and 11000311201.
It is not an unprimeable number, because it can be changed into a prime (11000311241) 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, 31976 + ... + 151733.
It is an arithmetic number, because the mean of its divisors is an integer number (2750138700).
Almost surely, 211000311211 is an apocalyptic number.
11000311211 is a deficient number, since it is larger than the sum of its proper divisors (243589).
11000311211 is an equidigital number, since it uses as much as digits as its factorization.
11000311211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243588.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11000311211 its reverse (11211300011), we get a palindrome (22211611222).
The spelling of 11000311211 in words is "eleven billion, three hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •