Search a number
-
+
10161272351 = 174114578583
BaseRepresentation
bin10010111011010100…
…01011011000011111
3222020011020010012102
421131222023120133
5131302241203401
64400143155315
7506543250506
oct113552133037
928204203172
1010161272351
11434485634a
121b76ba5b3b
13c5c2350b9
146c574383d
153e711756b
hex25da8b61f

10161272351 has 8 divisors (see below), whose sum is σ = 11021409504. Its totient is φ = 9330292480.

The previous prime is 10161272309. The next prime is 10161272369. The reversal of 10161272351 is 15327216101.

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 10161272351 - 210 = 10161271327 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 210161272351 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14578641.

The product of its (nonzero) digits is 2520, while the sum is 29.

Adding to 10161272351 its reverse (15327216101), we get a palindrome (25488488452).

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

Divisors: 1 17 41 697 14578583 247835911 597721903 10161272351