Search a number
-
+
131001014626 = 2164773975269
BaseRepresentation
bin111101000000001000…
…1001101100101100010
3110112010200112001112121
41322000101031211202
54121242224432001
6140103034214454
712315220152226
oct1720021154542
9415120461477
10131001014626
1150614726249
122147bb8442a
13c4793a8791
1464aa3dc786
15361ab956a1
hex1e8044d962

131001014626 has 8 divisors (see below), whose sum is σ = 196513497180. Its totient is φ = 65496515568.

The previous prime is 131001014603. The next prime is 131001014653. The reversal of 131001014626 is 626410100131.

It can be written as a sum of positive squares in 2 ways, for example, as 112728734001 + 18272280625 = 335751^2 + 135175^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a self number, because there is not a number n which added to its sum of digits gives 131001014626.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1954681 + ... + 2020588.

Almost surely, 2131001014626 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3991748.

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

Adding to 131001014626 its reverse (626410100131), we get a palindrome (757411114757).

The spelling of 131001014626 in words is "one hundred thirty-one billion, one million, fourteen thousand, six hundred twenty-six".

Divisors: 1 2 16477 32954 3975269 7950538 65500507313 131001014626