Base | Representation |
---|---|
bin | 100001111101111000110 |
3 | 2002112210100 |
4 | 10033233012 |
5 | 241104110 |
6 | 35504530 |
7 | 12313662 |
oct | 4175706 |
9 | 2075710 |
10 | 1113030 |
11 | 6a0266 |
12 | 458146 |
13 | 2cc7c9 |
14 | 20d8a2 |
15 | 16ebc0 |
hex | 10fbc6 |
1113030 has 48 divisors (see below), whose sum is σ = 2948400. Its totient is φ = 291264.
The previous prime is 1113029. The next prime is 1113043. The reversal of 1113030 is 303111.
1113030 = 5262 + 5272 + ... + 5292.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7396 + ... + 7544.
It is an arithmetic number, because the mean of its divisors is an integer number (61425).
21113030 is an apocalyptic number.
1113030 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 1113030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1474200).
1113030 is an abundant number, since it is smaller than the sum of its proper divisors (1835370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113030 is a wasteful number, since it uses less digits than its factorization.
1113030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245 (or 242 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1113030 is about 1055.0023696656. The cubic root of 1113030 is about 103.6340069136.
Adding to 1113030 its reverse (303111), we get a palindrome (1416141).
It can be divided in two parts, 11 and 13030, that added together give a triangular number (13041 = T161).
The spelling of 1113030 in words is "one million, one hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •