Search a number
-
+
10131000201 = 327160809527
BaseRepresentation
bin10010110111101101…
…01100101110001001
3222011001021010121200
421123312230232021
5131222014001301
64353142254413
7506025036510
oct113366545611
928131233550
1010131000201
11432975a443
121b68a27409
13c55b9629a
146c1703677
153e4637c86
hex25bdacb89

10131000201 has 12 divisors (see below), whose sum is σ = 16724190912. Its totient is φ = 5789142936.

The previous prime is 10131000199. The next prime is 10131000221. The reversal of 10131000201 is 10200013101.

It is not a de Polignac number, because 10131000201 - 21 = 10131000199 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

Almost surely, 210131000201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 160809540 (or 160809537 counting only the distinct ones).

The product of its (nonzero) digits is 6, while the sum is 9.

Adding to 10131000201 its reverse (10200013101), we get a palindrome (20331013302).

The spelling of 10131000201 in words is "ten billion, one hundred thirty-one million, two hundred one", and thus it is an aban number.

Divisors: 1 3 7 9 21 63 160809527 482428581 1125666689 1447285743 3377000067 10131000201