Search a number
-
+
162053536 = 255064173
BaseRepresentation
bin10011010100010…
…11110110100000
3102021221011122211
421222023312200
5312441203121
624025211504
74005301201
oct1152136640
9367834584
10162053536
1183525247
1246330b94
132775c388
14177455a8
15e360ce1
hex9a8bda0

162053536 has 12 divisors (see below), whose sum is σ = 319042962. Its totient is φ = 81026752.

The previous prime is 162053497. The next prime is 162053539. The reversal of 162053536 is 635350261.

It can be written as a sum of positive squares in only one way, i.e., 94090000 + 67963536 = 9700^2 + 8244^2 .

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

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

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

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2532055 + ... + 2532118.

Almost surely, 2162053536 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 16200, while the sum is 31.

The square root of 162053536 is about 12730.0249803368. The cubic root of 162053536 is about 545.1962214631.

The spelling of 162053536 in words is "one hundred sixty-two million, fifty-three thousand, five hundred thirty-six".

Divisors: 1 2 4 8 16 32 5064173 10128346 20256692 40513384 81026768 162053536