Base | Representation |
---|---|
bin | 101010010110… |
… | …011100111101 |
3 | 202220001002200 |
4 | 222112130331 |
5 | 10320231023 |
6 | 1033542113 |
7 | 163236246 |
oct | 52263475 |
9 | 22801080 |
10 | 11102013 |
11 | 62a311a |
12 | 3874939 |
13 | 23b9350 |
14 | 168dccd |
15 | e94743 |
hex | a9673d |
11102013 has 12 divisors (see below), whose sum is σ = 17269980. Its totient is φ = 6831936.
The previous prime is 11102009. The next prime is 11102051. The reversal of 11102013 is 31020111.
It can be written as a sum of positive squares in 2 ways, for example, as 7518564 + 3583449 = 2742^2 + 1893^2 .
It is not a de Polignac number, because 11102013 - 22 = 11102009 is a prime.
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 = 11101986 and 11102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102083) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47328 + ... + 47561.
It is an arithmetic number, because the mean of its divisors is an integer number (1439165).
Almost surely, 211102013 is an apocalyptic number.
11102013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11102013 is a deficient number, since it is larger than the sum of its proper divisors (6167967).
11102013 is a wasteful number, since it uses less digits than its factorization.
11102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94908 (or 94905 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11102013 is about 3331.9683371845. The cubic root of 11102013 is about 223.0833943091.
Adding to 11102013 its reverse (31020111), we get a palindrome (42122124).
The spelling of 11102013 in words is "eleven million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •