Search a number
-
+
1105563231 = 32277443467
BaseRepresentation
bin100000111100101…
…1000111001011111
32212001022102122100
41001321120321133
54231011010411
6301412020143
736253063263
oct10171307137
92761272570
101105563231
11518075023
1226a301653
1314807ac36
14a6b8a0a3
15670d4456
hex41e58e5f

1105563231 has 12 divisors (see below), whose sum is σ = 1602693352. Its totient is φ = 734379696.

The previous prime is 1105563229. The next prime is 1105563289. The reversal of 1105563231 is 1323655011.

It is not a de Polignac number, because 1105563231 - 21 = 1105563229 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 219241 + ... + 224226.

Almost surely, 21105563231 is an apocalyptic number.

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

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

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

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

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

The square root of 1105563231 is about 33250.0109924794. The cubic root of 1105563231 is about 1034.0174362011.

The spelling of 1105563231 in words is "one billion, one hundred five million, five hundred sixty-three thousand, two hundred thirty-one".

Divisors: 1 3 9 277 831 2493 443467 1330401 3991203 122840359 368521077 1105563231