Search a number
-
+
131511110032 = 2431265143367
BaseRepresentation
bin111101001111010101…
…1000100100110010000
3110120110020100120220001
41322132223010212100
54123313321010112
6140225415255344
712333652663651
oct1723653044620
9416406316801
10131511110032
11508566584a5
12215a297a554
13c52ac86993
146518061528
15364a854c57
hex1e9eac4990

131511110032 has 20 divisors (see below), whose sum is σ = 263022221056. Its totient is φ = 63634407840.

The previous prime is 131511109987. The next prime is 131511110069. The reversal of 131511110032 is 230011115131.

131511110032 is an admirable number.

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

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

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, 132571188 + ... + 132572179.

Almost surely, 2131511110032 is an apocalyptic number.

It is an amenable number.

131511110032 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 19.

Adding to 131511110032 its reverse (230011115131), we get a palindrome (361522225163).

The spelling of 131511110032 in words is "one hundred thirty-one billion, five hundred eleven million, one hundred ten thousand, thirty-two".

Divisors: 1 2 4 8 16 31 62 124 248 496 265143367 530286734 1060573468 2121146936 4242293872 8219444377 16438888754 32877777508 65755555016 131511110032