Search a number
-
+
1016032161 = 33115976841
BaseRepresentation
bin111100100011110…
…110101110100001
32121210211210002210
4330203312232201
54040101012121
6244453032333
734115062614
oct7443665641
92553753083
101016032161
11481584001
122443256a9
13132661581
1498d2217b
155e2eb876
hex3c8f6ba1

1016032161 has 16 divisors (see below), whose sum is σ = 1399490048. Its totient is φ = 654998400.

The previous prime is 1016032159. The next prime is 1016032169. The reversal of 1016032161 is 1612306101.

It is not a de Polignac number, because 1016032161 - 21 = 1016032159 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (1016032169) 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 15 ways as a sum of consecutive naturals, for example, 145101 + ... + 151941.

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

Almost surely, 21016032161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8472.

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

The square root of 1016032161 is about 31875.2593871799. The cubic root of 1016032161 is about 1005.3157464372.

Adding to 1016032161 its reverse (1612306101), we get a palindrome (2628338262).

The spelling of 1016032161 in words is "one billion, sixteen million, thirty-two thousand, one hundred sixty-one".

Divisors: 1 3 31 93 1597 4791 6841 20523 49507 148521 212071 636213 10925077 32775231 338677387 1016032161