Search a number
-
+
13011010131 = 37288510273
BaseRepresentation
bin11000001111000010…
…00100001001010011
31020120202111210112010
430013201010021103
5203121304311011
65551023034003
7640265522100
oct140741041123
936522453463
1013011010131
115577415539
12263143b903
1312c4758282
148b5dd3aa7
155123c91a6
hex307844253

13011010131 has 12 divisors (see below), whose sum is σ = 20180342472. Its totient is φ = 7434862848.

The previous prime is 13011010081. The next prime is 13011010169. The reversal of 13011010131 is 13101011031.

It is not a de Polignac number, because 13011010131 - 231 = 10863526483 is a prime.

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

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

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

Almost surely, 213011010131 is an apocalyptic number.

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

13011010131 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 13011010131 its reverse (13101011031), we get a palindrome (26112021162).

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

Divisors: 1 3 7 21 49 147 88510273 265530819 619571911 1858715733 4337003377 13011010131