Search a number
-
+
161015592 = 2336708983
BaseRepresentation
bin10011001100011…
…10011100101000
3102012222102212110
421212032130220
5312204444332
623551042320
73663416133
oct1146163450
9365872773
10161015592
1182986441
1245b103a0
1327487aca
141755521a
15e2084cc
hex998e728

161015592 has 16 divisors (see below), whose sum is σ = 402539040. Its totient is φ = 53671856.

The previous prime is 161015587. The next prime is 161015593. The reversal of 161015592 is 295510161.

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

It is not an unprimeable number, because it can be changed into a prime (161015593) 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 in 3 ways as a sum of consecutive naturals, for example, 3354468 + ... + 3354515.

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

Almost surely, 2161015592 is an apocalyptic number.

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

It is an amenable number.

161015592 is an abundant number, since it is smaller than the sum of its proper divisors (241523448).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 161015592 is about 12689.1919364473. The cubic root of 161015592 is about 544.0297435439.

The spelling of 161015592 in words is "one hundred sixty-one million, fifteen thousand, five hundred ninety-two".

Divisors: 1 2 3 4 6 8 12 24 6708983 13417966 20126949 26835932 40253898 53671864 80507796 161015592