Search a number
-
+
1101550161 = 3715171597
BaseRepresentation
bin100000110101000…
…0101001001010001
32211202202112202010
41001222011021101
54223444101121
6301150013133
736204010335
oct10152051121
92752675663
101101550161
11515883a38
12268aa71a9
131472a443a
14a64237c5
1566a90376
hex41a85251

1101550161 has 8 divisors (see below), whose sum is σ = 1489420224. Its totient is φ = 724023440.

The previous prime is 1101550159. The next prime is 1101550169. The reversal of 1101550161 is 1610551011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 1101550161 - 21 = 1101550159 is a prime.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2585586 + ... + 2586011.

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

Almost surely, 21101550161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5171671.

The product of its (nonzero) digits is 150, while the sum is 21.

The square root of 1101550161 is about 33189.6092324089. The cubic root of 1101550161 is about 1032.7647970554.

The spelling of 1101550161 in words is "one billion, one hundred one million, five hundred fifty thousand, one hundred sixty-one".

Divisors: 1 3 71 213 5171597 15514791 367183387 1101550161