Search a number
-
+
131015141001 = 3231557843067
BaseRepresentation
bin111101000000100011…
…1000110011010001001
3110112011200002202021200
41322001013012122021
54121304334003001
6140104301054413
712315451216053
oct1720107063211
9415150082250
10131015141001
11506216a4638
1221484857409
13c47c2b3594
1464ac2388d3
15361c036086
hex1e811c6689

131015141001 has 24 divisors (see below), whose sum is σ = 195699688704. Its totient is φ = 84374045280.

The previous prime is 131015140987. The next prime is 131015141011. The reversal of 131015141001 is 100141510131.

It is not a de Polignac number, because 131015141001 - 211 = 131015138953 is a prime.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 266131 + ... + 576936.

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

Almost surely, 2131015141001 is an apocalyptic number.

It is an amenable number.

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

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

131015141001 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 131015141001 its reverse (100141510131), we get a palindrome (231156651132).

The spelling of 131015141001 in words is "one hundred thirty-one billion, fifteen million, one hundred forty-one thousand, one".

Divisors: 1 3 9 31 93 279 557 1671 5013 17267 51801 155403 843067 2529201 7587603 26135077 78405231 235215693 469588319 1408764957 4226294871 14557237889 43671713667 131015141001