Base | Representation |
---|---|
bin | 10100100000110000… |
… | …10000100100010011 |
3 | 1001102110102101100011 |
4 | 22100120100210103 |
5 | 140023111304021 |
6 | 5020421535351 |
7 | 536615160202 |
oct | 122030204423 |
9 | 31373371304 |
10 | 11012213011 |
11 | 474111a698 |
12 | 2173b74557 |
13 | 1066612597 |
14 | 76676d239 |
15 | 446ba2de1 |
hex | 290610913 |
11012213011 has 4 divisors (see below), whose sum is σ = 11268311032. Its totient is φ = 10756114992.
The previous prime is 11012212969. The next prime is 11012213041. The reversal of 11012213011 is 11031221011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11012213011 - 217 = 11012081939 is a prime.
It is a super-2 number, since 2×110122130112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012212982 and 11012213000.
It is not an unprimeable number, because it can be changed into a prime (11012213041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128048946 + ... + 128049031.
It is an arithmetic number, because the mean of its divisors is an integer number (2817077758).
Almost surely, 211012213011 is an apocalyptic number.
11012213011 is a deficient number, since it is larger than the sum of its proper divisors (256098021).
11012213011 is an equidigital number, since it uses as much as digits as its factorization.
11012213011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256098020.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11012213011 its reverse (11031221011), we get a palindrome (22043434022).
The spelling of 11012213011 in words is "eleven billion, twelve million, two hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •