Base | Representation |
---|---|
bin | 101001110010000011100 |
3 | 2120120002000 |
4 | 11032100130 |
5 | 322302431 |
6 | 45202300 |
7 | 14431410 |
oct | 5162034 |
9 | 2516060 |
10 | 1369116 |
11 | 855701 |
12 | 560390 |
13 | 38c238 |
14 | 278d40 |
15 | 1c09e6 |
hex | 14e41c |
1369116 has 48 divisors (see below), whose sum is σ = 4058880. Its totient is φ = 390960.
The previous prime is 1369103. The next prime is 1369133. The reversal of 1369116 is 6119631.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1369116.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 150 + ... + 1661.
It is an arithmetic number, because the mean of its divisors is an integer number (84560).
21369116 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1369116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2029440).
1369116 is an abundant number, since it is smaller than the sum of its proper divisors (2689764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1369116 is a wasteful number, since it uses less digits than its factorization.
1369116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1831 (or 1823 counting only the distinct ones).
The product of its digits is 972, while the sum is 27.
The square root of 1369116 is about 1170.0923040513. The cubic root of 1369116 is about 111.0401607782.
It can be divided in two parts, 1369 and 116, that added together give a triangular number (1485 = T54).
The spelling of 1369116 in words is "one million, three hundred sixty-nine thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •