Base | Representation |
---|---|
bin | 10100110111001010… |
… | …11010010001011101 |
3 | 1001220120011121202002 |
4 | 22123211122101131 |
5 | 140414223210023 |
6 | 5051215212045 |
7 | 544360133336 |
oct | 123345322135 |
9 | 31816147662 |
10 | 11200210013 |
11 | 4828254613 |
12 | 2206b17025 |
13 | 1096556405 |
14 | 78370928d |
15 | 45843ab28 |
hex | 29b95a45d |
11200210013 has 4 divisors (see below), whose sum is σ = 11258850048. Its totient is φ = 11141569980.
The previous prime is 11200209991. The next prime is 11200210037. The reversal of 11200210013 is 31001200211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31001200211 = 761 ⋅40737451.
It is a cyclic number.
It is not a de Polignac number, because 11200210013 - 212 = 11200205917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11200209976 and 11200210003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200210093) 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, 29319731 + ... + 29320112.
It is an arithmetic number, because the mean of its divisors is an integer number (2814712512).
Almost surely, 211200210013 is an apocalyptic number.
It is an amenable number.
11200210013 is a deficient number, since it is larger than the sum of its proper divisors (58640035).
11200210013 is an equidigital number, since it uses as much as digits as its factorization.
11200210013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58640034.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11200210013 its reverse (31001200211), we get a palindrome (42201410224).
The spelling of 11200210013 in words is "eleven billion, two hundred million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •