Search a number
-
+
10110001131 = 321123333459
BaseRepresentation
bin10010110101001101…
…00101111111101011
3222002120202021022100
421122212211333223
5131201130014011
64351112224443
7505351406646
oct113246457753
928076667270
1010110001131
11431891753a
121b6199b123
13c517231b9
146bc9d8a5d
153e288ad56
hex25a9a5feb

10110001131 has 6 divisors (see below), whose sum is σ = 14603334980. Its totient is φ = 6740000748.

The previous prime is 10110001093. The next prime is 10110001157. The reversal of 10110001131 is 13110001101.

It is not a de Polignac number, because 10110001131 - 211 = 10109999083 is a prime.

It is a super-2 number, since 2×101100011312 (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: 1123333459 = 10110001131 / (1 + 0 + 1 + 1 + 0 + 0 + 0 + 1 + 1 + 3 + 1).

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10110001331) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 561666721 + ... + 561666738.

Almost surely, 210110001131 is an apocalyptic number.

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

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

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

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

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

Adding to 10110001131 its reverse (13110001101), we get a palindrome (23220002232).

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

Divisors: 1 3 9 1123333459 3370000377 10110001131