Search a number
-
+
1055835 = 3551179
BaseRepresentation
bin100000001110001011011
31222122100000
410001301123
5232241320
634344043
711655144
oct4016133
91878300
101055835
116612a0
1242b023
132ac771
141d6acb
1515cc90
hex101c5b

1055835 has 48 divisors (see below), whose sum is σ = 2096640. Its totient is φ = 505440.

The previous prime is 1055827. The next prime is 1055839. The reversal of 1055835 is 5385501.

It is not a de Polignac number, because 1055835 - 23 = 1055827 is a prime.

It is a super-2 number, since 2×10558352 = 2229575094450, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a junction number, because it is equal to n+sod(n) for n = 1055799 and 1055808.

It is not an unprimeable number, because it can be changed into a prime (1055839) by changing a digit.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13326 + ... + 13404.

It is an arithmetic number, because the mean of its divisors is an integer number (43680).

21055835 is an apocalyptic number.

1055835 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

1055835 is a deficient number, since it is larger than the sum of its proper divisors (1040805).

1055835 is an equidigital number, since it uses as much as digits as its factorization.

1055835 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 110 (or 98 counting only the distinct ones).

The product of its (nonzero) digits is 3000, while the sum is 27.

The square root of 1055835 is about 1027.5383204533. The cubic root of 1055835 is about 101.8275633217.

The spelling of 1055835 in words is "one million, fifty-five thousand, eight hundred thirty-five".

Divisors: 1 3 5 9 11 15 27 33 45 55 79 81 99 135 165 237 243 297 395 405 495 711 869 891 1185 1215 1485 2133 2607 2673 3555 4345 4455 6399 7821 10665 13035 13365 19197 23463 31995 39105 70389 95985 117315 211167 351945 1055835