Search a number
-
+
10000300131 = 321111144459
BaseRepresentation
bin10010101000001000…
…00111100001100011
3221210221022212211100
421110010013201203
5130440034101011
64332153045443
7502550101653
oct112404074143
927727285740
1010000300131
1142719aa558
121b310b6883
13c34a93c73
146ac200363
153d7e1bd56
hex254107863

10000300131 has 6 divisors (see below), whose sum is σ = 14444877980. Its totient is φ = 6666866748.

The previous prime is 10000300127. The next prime is 10000300169. The reversal of 10000300131 is 13100300001.

It is not a de Polignac number, because 10000300131 - 22 = 10000300127 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1111144459 = 10000300131 / (1 + 0 + 0 + 0 + 0 + 3 + 0 + 0 + 1 + 3 + 1).

It is a Duffinian number.

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

Almost surely, 210000300131 is an apocalyptic number.

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

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

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

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

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

Adding to 10000300131 its reverse (13100300001), we get a palindrome (23100600132).

The spelling of 10000300131 in words is "ten billion, three hundred thousand, one hundred thirty-one".

Divisors: 1 3 9 1111144459 3333433377 10000300131