Base | Representation |
---|---|
bin | 100001000000011010101 |
3 | 2000221121200 |
4 | 10020003111 |
5 | 234102212 |
6 | 35103113 |
7 | 12123141 |
oct | 4100325 |
9 | 2027550 |
10 | 1081557 |
11 | 679654 |
12 | 441a99 |
13 | 2bb399 |
14 | 202221 |
15 | 1656dc |
hex | 1080d5 |
1081557 has 12 divisors (see below), whose sum is σ = 1654380. Its totient is φ = 678528.
The previous prime is 1081541. The next prime is 1081583. The reversal of 1081557 is 7551801.
1081557 is a `hidden beast` number, since 108 + 1 + 557 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 617796 + 463761 = 786^2 + 681^2 .
It is not a de Polignac number, because 1081557 - 24 = 1081541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1081557.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1081657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3382 + ... + 3687.
It is an arithmetic number, because the mean of its divisors is an integer number (137865).
21081557 is an apocalyptic number.
1081557 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1081557 is a deficient number, since it is larger than the sum of its proper divisors (572823).
1081557 is a wasteful number, since it uses less digits than its factorization.
1081557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7092 (or 7089 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
The square root of 1081557 is about 1039.9793267176. The cubic root of 1081557 is about 102.6478374326.
The spelling of 1081557 in words is "one million, eighty-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •