Search a number
-
+
10171270151 = 72363175591
BaseRepresentation
bin10010111100100000…
…10100010000000111
3222020212001001121022
421132100110100013
5131312321121101
64401141341355
7510024240560
oct113620242007
928225031538
1010171270151
11434a464899
121b7a40785b
13c61325963
146c6bc7167
153e7e3ea1b
hex25e414407

10171270151 has 8 divisors (see below), whose sum is σ = 12129713664. Its totient is φ = 8339177880.

The previous prime is 10171270147. The next prime is 10171270163. The reversal of 10171270151 is 15107217101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10171270151 - 22 = 10171270147 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10171270151.

It is a congruent number.

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

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

Almost surely, 210171270151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 63175621.

The product of its (nonzero) digits is 490, while the sum is 26.

Adding to 10171270151 its reverse (15107217101), we get a palindrome (25278487252).

The spelling of 10171270151 in words is "ten billion, one hundred seventy-one million, two hundred seventy thousand, one hundred fifty-one".

Divisors: 1 7 23 161 63175591 442229137 1453038593 10171270151