Base | Representation |
---|---|
bin | 10100110111011001… |
… | …01000011011100001 |
3 | 1001220200201210110001 |
4 | 22123230220123201 |
5 | 140420214244014 |
6 | 5051323540001 |
7 | 544412206306 |
oct | 123354503341 |
9 | 31820653401 |
10 | 11202103009 |
11 | 4829327879 |
12 | 220768a601 |
13 | 1096a69c26 |
14 | 783a7d0ad |
15 | 4586b1974 |
hex | 29bb286e1 |
11202103009 has 2 divisors, whose sum is σ = 11202103010. Its totient is φ = 11202103008.
The previous prime is 11202103007. The next prime is 11202103109. The reversal of 11202103009 is 90030120211.
11202103009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10382998609 + 819104400 = 101897^2 + 28620^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202103009 - 21 = 11202103007 is a prime.
It is a super-2 number, since 2×112021030092 (a number of 21 digits) contains 22 as substring.
Together with 11202103007, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11202103007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601051504 + 5601051505.
It is an arithmetic number, because the mean of its divisors is an integer number (5601051505).
Almost surely, 211202103009 is an apocalyptic number.
It is an amenable number.
11202103009 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202103009 is an equidigital number, since it uses as much as digits as its factorization.
11202103009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
The spelling of 11202103009 in words is "eleven billion, two hundred two million, one hundred three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •