Base | Representation |
---|---|
bin | 10100101011011111… |
… | …00010010010011001 |
3 | 1001122201202020122002 |
4 | 22111233202102121 |
5 | 140214130412420 |
6 | 5033354410345 |
7 | 542060102621 |
oct | 122557422231 |
9 | 31581666562 |
10 | 11102200985 |
11 | 47879a2a17 |
12 | 219a1309b5 |
13 | 107c15bbc5 |
14 | 7746b5881 |
15 | 44ea2b075 |
hex | 295be2499 |
11102200985 has 16 divisors (see below), whose sum is σ = 13515670800. Its totient is φ = 8753264640.
The previous prime is 11102200981. The next prime is 11102200997. The reversal of 11102200985 is 58900220111.
11102200985 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 1724990089 + 9377210896 = 41533^2 + 96836^2 .
It is not a de Polignac number, because 11102200985 - 22 = 11102200981 is a prime.
It is a super-2 number, since 2×111022009852 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11102200981) 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 15 ways as a sum of consecutive naturals, for example, 485591 + ... + 507939.
It is an arithmetic number, because the mean of its divisors is an integer number (844729425).
Almost surely, 211102200985 is an apocalyptic number.
It is an amenable number.
11102200985 is a deficient number, since it is larger than the sum of its proper divisors (2413469815).
11102200985 is a wasteful number, since it uses less digits than its factorization.
11102200985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23788.
The product of its (nonzero) digits is 1440, while the sum is 29.
The spelling of 11102200985 in words is "eleven billion, one hundred two million, two hundred thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •