Base | Representation |
---|---|
bin | 10100100000111000… |
… | …11001111111110011 |
3 | 1001102112110121200211 |
4 | 22100130121333303 |
5 | 140023401101321 |
6 | 5020501124551 |
7 | 536630335654 |
oct | 122034317763 |
9 | 31375417624 |
10 | 11013300211 |
11 | 47417a2501 |
12 | 21743b9757 |
13 | 10669033b4 |
14 | 76697352b |
15 | 446d1a0e1 |
hex | 290719ff3 |
11013300211 has 4 divisors (see below), whose sum is σ = 11018519424. Its totient is φ = 11008081000.
The previous prime is 11013300203. The next prime is 11013300227. The reversal of 11013300211 is 11200331011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11013300211 - 23 = 11013300203 is a prime.
It is a super-2 number, since 2×110133002112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11013300191 and 11013300200.
It is not an unprimeable number, because it can be changed into a prime (11013300511) 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 3 ways as a sum of consecutive naturals, for example, 2606440 + ... + 2610661.
It is an arithmetic number, because the mean of its divisors is an integer number (2754629856).
Almost surely, 211013300211 is an apocalyptic number.
11013300211 is a deficient number, since it is larger than the sum of its proper divisors (5219213).
11013300211 is an equidigital number, since it uses as much as digits as its factorization.
11013300211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5219212.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11013300211 its reverse (11200331011), we get a palindrome (22213631222).
The spelling of 11013300211 in words is "eleven billion, thirteen million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •