Base | Representation |
---|---|
bin | 101010000000… |
… | …111011101110 |
3 | 202201120012010 |
4 | 222000323232 |
5 | 10304420440 |
6 | 1032022050 |
7 | 162421260 |
oct | 52007356 |
9 | 22646163 |
10 | 11013870 |
11 | 624297a |
12 | 3831926 |
13 | 23881aa |
14 | 1669b30 |
15 | e78580 |
hex | a80eee |
11013870 has 64 divisors (see below), whose sum is σ = 30481920. Its totient is φ = 2494848.
The previous prime is 11013853. The next prime is 11013883. The reversal of 11013870 is 7831011.
11013870 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 37444 + ... + 37736.
It is an arithmetic number, because the mean of its divisors is an integer number (476280).
Almost surely, 211013870 is an apocalyptic number.
11013870 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11013870, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15240960).
11013870 is an abundant number, since it is smaller than the sum of its proper divisors (19468050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013870 is a wasteful number, since it uses less digits than its factorization.
11013870 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 489.
The product of its (nonzero) digits is 168, while the sum is 21.
The square root of 11013870 is about 3318.7151128110. The cubic root of 11013870 is about 222.4914443539.
Adding to 11013870 its reverse (7831011), we get a palindrome (18844881).
The spelling of 11013870 in words is "eleven million, thirteen thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •