Base | Representation |
---|---|
bin | 101010000000… |
… | …101110010100 |
3 | 202201112000100 |
4 | 222000232110 |
5 | 10304404022 |
6 | 1032014100 |
7 | 162415623 |
oct | 52005624 |
9 | 22645010 |
10 | 11013012 |
11 | 624226a |
12 | 3831330 |
13 | 238799a |
14 | 16696ba |
15 | e781ac |
hex | a80b94 |
11013012 has 18 divisors (see below), whose sum is σ = 27838538. Its totient is φ = 3670992.
The previous prime is 11012971. The next prime is 11013017. The reversal of 11013012 is 21031011.
It can be written as a sum of positive squares in only one way, i.e., 9960336 + 1052676 = 3156^2 + 1026^2 .
It is a tau number, because it is divible by the number of its divisors (18).
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 = 11012985 and 11013003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11013017) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 152923 + ... + 152994.
Almost surely, 211013012 is an apocalyptic number.
11013012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013012 is an abundant number, since it is smaller than the sum of its proper divisors (16825526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013012 is a wasteful number, since it uses less digits than its factorization.
11013012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305927 (or 305922 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11013012 is about 3318.5858433978. The cubic root of 11013012 is about 222.4856667112.
Adding to 11013012 its reverse (21031011), we get a palindrome (32044023).
The spelling of 11013012 in words is "eleven million, thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •