Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11001101111011011 |
3 | 1001102101112000111201 |
4 | 22100110121233123 |
5 | 140022331431021 |
6 | 5020344135031 |
7 | 536603446525 |
oct | 122024315733 |
9 | 31371460451 |
10 | 11011202011 |
11 | 474059a057 |
12 | 2173767477 |
13 | 106634a364 |
14 | 766588a15 |
15 | 446a53591 |
hex | 290519bdb |
11011202011 has 4 divisors (see below), whose sum is σ = 11011514800. Its totient is φ = 11010889224.
The previous prime is 11011201991. The next prime is 11011202017. The reversal of 11011202011 is 11020211011.
11011202011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11020211011 = 43 ⋅256283977.
It is a cyclic number.
It is not a de Polignac number, because 11011202011 - 25 = 11011201979 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011202017) 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 in 3 ways as a sum of consecutive naturals, for example, 95751 + ... + 176608.
It is an arithmetic number, because the mean of its divisors is an integer number (2752878700).
Almost surely, 211011202011 is an apocalyptic number.
11011202011 is a deficient number, since it is larger than the sum of its proper divisors (312789).
11011202011 is an equidigital number, since it uses as much as digits as its factorization.
11011202011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312788.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11011202011 its reverse (11020211011), we get a palindrome (22031413022).
The spelling of 11011202011 in words is "eleven billion, eleven million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •