Search a number
-
+
1000156971 = 311171782811
BaseRepresentation
bin111011100111010…
…010111100101011
32120200222020102210
4323213102330223
54022020010341
6243124500203
733533123352
oct7347227453
92520866383
101000156971
11473620810
1223ab4a663
1312c293778
1496b8c999
155cc12c16
hex3b9d2f2b

1000156971 has 16 divisors (see below), whose sum is σ = 1540349568. Its totient is φ = 570499200.

The previous prime is 1000156943. The next prime is 1000156981. The reversal of 1000156971 is 1796510001.

It is not a de Polignac number, because 1000156971 - 214 = 1000140587 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 890845 + ... + 891966.

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

Almost surely, 21000156971 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1782842.

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

The square root of 1000156971 is about 31625.2584337267. The cubic root of 1000156971 is about 1000.0523209291.

Adding to 1000156971 its reverse (1796510001), we get a palindrome (2796666972).

The spelling of 1000156971 in words is "one billion, one hundred fifty-six thousand, nine hundred seventy-one".

Divisors: 1 3 11 17 33 51 187 561 1782811 5348433 19610921 30307787 58832763 90923361 333385657 1000156971