Search a number
-
+
131510151426 = 23773161317579
BaseRepresentation
bin111101001111010011…
…1011010100100000010
3110120110011112212221010
41322132213122210002
54123313044321201
6140225342541350
712333641562123
oct1723647324402
9416404485833
10131510151426
1150856063265
12215a2597856
13c52aa0c564
146517c9204a
15364a715bd6
hex1e9e9da902

131510151426 has 32 divisors (see below), whose sum is σ = 263538826560. Its totient is φ = 43750376384.

The previous prime is 131510151413. The next prime is 131510151449. The reversal of 131510151426 is 624151015131.

It is a junction number, because it is equal to n+sod(n) for n = 131510151393 and 131510151402.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 7472305 + ... + 7489883.

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

Almost surely, 2131510151426 is an apocalyptic number.

131510151426 is an abundant number, since it is smaller than the sum of its proper divisors (132028675134).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 19970.

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

Adding to 131510151426 its reverse (624151015131), we get a palindrome (755661166557).

The spelling of 131510151426 in words is "one hundred thirty-one billion, five hundred ten million, one hundred fifty-one thousand, four hundred twenty-six".

Divisors: 1 2 3 6 773 1546 1613 2319 3226 4638 4839 9678 17579 35158 52737 105474 1246849 2493698 3740547 7481094 13588567 27177134 28354927 40765701 56709854 81531402 85064781 170129562 21918358571 43836717142 65755075713 131510151426