Search a number
-
+
10201175131 = 712311183843
BaseRepresentation
bin10011000000000100…
…11001010001011011
3222022221022101112011
421200002121101123
5131343000101011
64404130330351
7510536362240
oct114002312133
928287271464
1010201175131
11436532a954
121b884299b7
13c67596604
146cab6d5c7
153ea89a621
hex26009945b

10201175131 has 8 divisors (see below), whose sum is σ = 11667966464. Its totient is φ = 8736753960.

The previous prime is 10201175129. The next prime is 10201175137. The reversal of 10201175131 is 13157110201.

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 10201175131 - 21 = 10201175129 is a prime.

It is a super-2 number, since 2×102011751312 (a number of 21 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (10201175137) 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, 583305 + ... + 600538.

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

Almost surely, 210201175131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1185081.

The product of its (nonzero) digits is 210, while the sum is 22.

Adding to 10201175131 its reverse (13157110201), we get a palindrome (23358285332).

The spelling of 10201175131 in words is "ten billion, two hundred one million, one hundred seventy-five thousand, one hundred thirty-one".

Divisors: 1 7 1231 8617 1183843 8286901 1457310733 10201175131