Base | Representation |
---|---|
bin | 100010010111111010111 |
3 | 2010020002000 |
4 | 10102333113 |
5 | 242020414 |
6 | 40050343 |
7 | 12400563 |
oct | 4227727 |
9 | 2106060 |
10 | 1126359 |
11 | 6aa283 |
12 | 4639b3 |
13 | 3058b0 |
14 | 2146a3 |
15 | 173b09 |
hex | 112fd7 |
1126359 has 16 divisors (see below), whose sum is σ = 1797600. Its totient is φ = 692928.
The previous prime is 1126357. The next prime is 1126361. The reversal of 1126359 is 9536211.
It is an interprime number because it is at equal distance from previous prime (1126357) and next prime (1126361).
It is not a de Polignac number, because 1126359 - 21 = 1126357 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1126351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1254 + ... + 1955.
It is an arithmetic number, because the mean of its divisors is an integer number (112350).
21126359 is an apocalyptic number.
1126359 is a deficient number, since it is larger than the sum of its proper divisors (671241).
1126359 is a wasteful number, since it uses less digits than its factorization.
1126359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3231 (or 3225 counting only the distinct ones).
The product of its digits is 1620, while the sum is 27.
The square root of 1126359 is about 1061.3006171674. The cubic root of 1126359 is about 104.0460533216.
It can be divided in two parts, 1126 and 359, that added together give a triangular number (1485 = T54).
The spelling of 1126359 in words is "one million, one hundred twenty-six thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •