Base | Representation |
---|---|
bin | 101010011000… |
… | …111001001010 |
3 | 202220112210221 |
4 | 222120321022 |
5 | 10321041020 |
6 | 1034100254 |
7 | 163310350 |
oct | 52307112 |
9 | 22815727 |
10 | 11112010 |
11 | 62aa688 |
12 | 387a68a |
13 | 23c0a70 |
14 | 16937d0 |
15 | e976aa |
hex | a98e4a |
11112010 has 32 divisors (see below), whose sum is σ = 24619392. Its totient is φ = 3516480.
The previous prime is 11112007. The next prime is 11112011. The reversal of 11112010 is 1021111.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 11111984 and 11112002.
It is not an unprimeable number, because it can be changed into a prime (11112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5196 + ... + 7015.
It is an arithmetic number, because the mean of its divisors is an integer number (769356).
Almost surely, 211112010 is an apocalyptic number.
11112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112010 is an abundant number, since it is smaller than the sum of its proper divisors (13507382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112010 is a wasteful number, since it uses less digits than its factorization.
11112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12238.
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 11112010 is about 3333.4681639398. The cubic root of 11112010 is about 223.1503339902.
Adding to 11112010 its reverse (1021111), we get a palindrome (12133121).
It can be divided in two parts, 111 and 12010, that added together give a palindrome (12121).
The spelling of 11112010 in words is "eleven million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •