Search a number
-
+
1037256161 is a prime number
BaseRepresentation
bin111101110100110…
…100010111100001
32200021210001221212
4331310310113201
54111014144121
6250531555505
734463350304
oct7564642741
92607701855
101037256161
1149255a9a7
1224b45bb95
13136b82b56
149ba88b3b
15610e025b
hex3dd345e1

1037256161 has 2 divisors, whose sum is σ = 1037256162. Its totient is φ = 1037256160.

The previous prime is 1037256149. The next prime is 1037256193. The reversal of 1037256161 is 1616527301.

It is an a-pointer prime, because the next prime (1037256193) can be obtained adding 1037256161 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1029190561 + 8065600 = 32081^2 + 2840^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1037256161 is a prime.

It is not a weakly prime, because it can be changed into another prime (1037256131) 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 as a sum of consecutive naturals, namely, 518628080 + 518628081.

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

Almost surely, 21037256161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7560, while the sum is 32.

The square root of 1037256161 is about 32206.4614790262. The cubic root of 1037256161 is about 1012.2676106603.

The spelling of 1037256161 in words is "one billion, thirty-seven million, two hundred fifty-six thousand, one hundred sixty-one".