Base | Representation |
---|---|
bin | 10100011111100100… |
… | …00110011011011011 |
3 | 1001101202121011210200 |
4 | 22033302012123123 |
5 | 140013031210021 |
6 | 5015423313243 |
7 | 536434146012 |
oct | 121762063333 |
9 | 31352534720 |
10 | 11002210011 |
11 | 4736508251 |
12 | 217074b823 |
13 | 106451c550 |
14 | 7652c7a79 |
15 | 445d79126 |
hex | 28fc866db |
11002210011 has 24 divisors (see below), whose sum is σ = 17858664096. Its totient is φ = 6476215680.
The previous prime is 11002210003. The next prime is 11002210027. The reversal of 11002210011 is 11001220011.
It is a happy number.
It is not a de Polignac number, because 11002210011 - 23 = 11002210003 is a prime.
It is a super-2 number, since 2×110022100112 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11002209975 and 11002210002.
It is not an unprimeable number, because it can be changed into a prime (11002210081) 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 23 ways as a sum of consecutive naturals, for example, 2041570 + ... + 2046951.
It is an arithmetic number, because the mean of its divisors is an integer number (744111004).
Almost surely, 211002210011 is an apocalyptic number.
11002210011 is a deficient number, since it is larger than the sum of its proper divisors (6856454085).
11002210011 is a wasteful number, since it uses less digits than its factorization.
11002210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4088563 (or 4088560 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11002210011 its reverse (11001220011), we get a palindrome (22003430022).
The spelling of 11002210011 in words is "eleven billion, two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •