Search a number
-
+
1096550169 = 311132556061
BaseRepresentation
bin100000101011100…
…0000011100011001
32211102100112001020
41001113000130121
54221204101134
6300450513053
736113344161
oct10127003431
92742315036
101096550169
11512a79410
12267295789
13146243670
14a58c15a1
1566403b49
hex415c0719

1096550169 has 16 divisors (see below), whose sum is σ = 1717673664. Its totient is φ = 613454400.

The previous prime is 1096550159. The next prime is 1096550171. The reversal of 1096550169 is 9610556901.

It is not a de Polignac number, because 1096550169 - 219 = 1096025881 is a prime.

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

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1096550169.

It is not an unprimeable number, because it can be changed into a prime (1096550159) 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, 1277602 + ... + 1278459.

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

Almost surely, 21096550169 is an apocalyptic number.

It is an amenable number.

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

1096550169 is a wasteful number, since it uses less digits than its factorization.

1096550169 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2556088.

The product of its (nonzero) digits is 72900, while the sum is 42.

The square root of 1096550169 is about 33114.1989031896. The cubic root of 1096550169 is about 1031.1998362670.

The spelling of 1096550169 in words is "one billion, ninety-six million, five hundred fifty thousand, one hundred sixty-nine".

Divisors: 1 3 11 13 33 39 143 429 2556061 7668183 28116671 33228793 84350013 99686379 365516723 1096550169