Search a number
-
+
1056171152 = 24411610017
BaseRepresentation
bin111110111100111…
…110010010010000
32201121101001110002
4332330332102100
54130334434102
6252445225132
735113210121
oct7674762220
92647331402
101056171152
114a21aa023
122558621a8
1313aa7645a
14a03b0048
1562ac9902
hex3ef3e490

1056171152 has 20 divisors (see below), whose sum is σ = 2096243436. Its totient is φ = 515205120.

The previous prime is 1056171113. The next prime is 1056171163. The reversal of 1056171152 is 2511716501.

It can be written as a sum of positive squares in 2 ways, for example, as 552438016 + 503733136 = 23504^2 + 22444^2 .

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

It is a Smith number, since the sum of its digits (29) coincides with the sum of the digits of its prime factors.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 804353 + ... + 805664.

Almost surely, 21056171152 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2100, while the sum is 29.

The square root of 1056171152 is about 32498.7869312071. The cubic root of 1056171152 is about 1018.3836864237.

Adding to 1056171152 its reverse (2511716501), we get a palindrome (3567887653).

The spelling of 1056171152 in words is "one billion, fifty-six million, one hundred seventy-one thousand, one hundred fifty-two".

Divisors: 1 2 4 8 16 41 82 164 328 656 1610017 3220034 6440068 12880136 25760272 66010697 132021394 264042788 528085576 1056171152