Base | Representation |
---|---|
bin | 10100110111001001… |
… | …01001011111100101 |
3 | 1001220112210110200002 |
4 | 22123210221133211 |
5 | 140414200311323 |
6 | 5051211031045 |
7 | 544355342000 |
oct | 123344513745 |
9 | 31815713602 |
10 | 11200010213 |
11 | 4828128497 |
12 | 2206a3b485 |
13 | 10964b64a2 |
14 | 783696537 |
15 | 4583eb828 |
hex | 29b9297e5 |
11200010213 has 32 divisors (see below), whose sum is σ = 13193241600. Its totient is φ = 9503585280.
The previous prime is 11200010209. The next prime is 11200010219. The reversal of 11200010213 is 31201000211.
It is not a de Polignac number, because 11200010213 - 22 = 11200010209 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11200010194 and 11200010203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200010219) 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 31 ways as a sum of consecutive naturals, for example, 24294803 + ... + 24295263.
It is an arithmetic number, because the mean of its divisors is an integer number (412288800).
Almost surely, 211200010213 is an apocalyptic number.
It is an amenable number.
11200010213 is a deficient number, since it is larger than the sum of its proper divisors (1993231387).
11200010213 is an equidigital number, since it uses as much as digits as its factorization.
11200010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042 (or 1028 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11200010213 its reverse (31201000211), we get a palindrome (42401010424).
The spelling of 11200010213 in words is "eleven billion, two hundred million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •