Base | Representation |
---|---|
bin | 10100110111011000… |
… | …01111010011110001 |
3 | 1001220200112120022002 |
4 | 22123230033103301 |
5 | 140420203000423 |
6 | 5051321423345 |
7 | 544411300313 |
oct | 123354172361 |
9 | 31820476262 |
10 | 11202000113 |
11 | 4829267537 |
12 | 220763ab55 |
13 | 1096a32145 |
14 | 783a537b3 |
15 | 458691228 |
hex | 29bb0f4f1 |
11202000113 has 4 divisors (see below), whose sum is σ = 11202930288. Its totient is φ = 11201069940.
The previous prime is 11202000067. The next prime is 11202000119. The reversal of 11202000113 is 31100020211.
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.
It is a cyclic number.
It is not a de Polignac number, because 11202000113 - 26 = 11202000049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11202000094 and 11202000103.
It is not an unprimeable number, because it can be changed into a prime (11202000119) 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, 446783 + ... + 471188.
It is an arithmetic number, because the mean of its divisors is an integer number (2800732572).
Almost surely, 211202000113 is an apocalyptic number.
It is an amenable number.
11202000113 is a deficient number, since it is larger than the sum of its proper divisors (930175).
11202000113 is an equidigital number, since it uses as much as digits as its factorization.
11202000113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930174.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11202000113 its reverse (31100020211), we get a palindrome (42302020324).
The spelling of 11202000113 in words is "eleven billion, two hundred two million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •