Base | Representation |
---|---|
bin | 100101001001000011100 |
3 | 2021211111000 |
4 | 10221020130 |
5 | 302421202 |
6 | 42030300 |
7 | 13226154 |
oct | 4511034 |
9 | 2254430 |
10 | 1217052 |
11 | 761431 |
12 | 4a8390 |
13 | 337c65 |
14 | 239764 |
15 | 19091c |
hex | 12921c |
1217052 has 48 divisors (see below), whose sum is σ = 3225600. Its totient is φ = 396720.
The previous prime is 1217033. The next prime is 1217053. The reversal of 1217052 is 2507121.
It is a super-3 number, since 3×12170523 = 5408149118269333824, which contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1217053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6277 + ... + 6467.
It is an arithmetic number, because the mean of its divisors is an integer number (67200).
21217052 is an apocalyptic number.
1217052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1217052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1612800).
1217052 is an abundant number, since it is smaller than the sum of its proper divisors (2008548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1217052 is a wasteful number, since it uses less digits than its factorization.
1217052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 263 (or 255 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 1217052 is about 1103.2007976792. The cubic root of 1217052 is about 106.7668373239.
The spelling of 1217052 in words is "one million, two hundred seventeen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •