Search a number
-
+
15143060665131 = 375411332898571
BaseRepresentation
bin1101110001011100010011…
…0000000111001100101011
31222121122212221020011020120
43130113010300013030223
53441100442012241011
652112343120054323
73122023105605630
oct334270460071453
958548787204216
1015143060665131
114909154a6a733
1218469b04643a3
1385aca4c16919
143a4cdc7bc187
151b3d8be0ea06
hexdc5c4c0732b

15143060665131 has 16 divisors (see below), whose sum is σ = 23117792832768. Its totient is φ = 8637182733600.

The previous prime is 15143060665127. The next prime is 15143060665171. The reversal of 15143060665131 is 13156606034151.

It is not a de Polignac number, because 15143060665131 - 22 = 15143060665127 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 666437925 + ... + 666460646.

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

Almost surely, 215143060665131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1332899122.

The product of its (nonzero) digits is 194400, while the sum is 42.

Adding to 15143060665131 its reverse (13156606034151), we get a palindrome (28299666699282).

The spelling of 15143060665131 in words is "fifteen trillion, one hundred forty-three billion, sixty million, six hundred sixty-five thousand, one hundred thirty-one".

Divisors: 1 3 7 21 541 1623 3787 11361 1332898571 3998695713 9330289997 27990869991 721098126911 2163294380733 5047686888377 15143060665131