Search a number
-
+
15500131323 = 3291491195721
BaseRepresentation
bin11100110111110000…
…10011101111111011
31111000020020020212220
432123320103233323
5223221013200243
611042021335123
71056051641145
oct163370235773
944006206786
1015500131323
116634469096
123006b674a3
131600348b51
14a70811c95
1560aba6783
hex39be13bfb

15500131323 has 16 divisors (see below), whose sum is σ = 21522996000. Its totient is φ = 9910127360.

The previous prime is 15500131321. The next prime is 15500131337. The reversal of 15500131323 is 32313100551.

It is a cyclic number.

It is not a de Polignac number, because 15500131323 - 21 = 15500131321 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 215500131323 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1195902.

The product of its (nonzero) digits is 1350, while the sum is 24.

Adding to 15500131323 its reverse (32313100551), we get a palindrome (47813231874).

The spelling of 15500131323 in words is "fifteen billion, five hundred million, one hundred thirty-one thousand, three hundred twenty-three".

Divisors: 1 3 29 87 149 447 4321 12963 1195721 3587163 34675909 104027727 178162429 534487287 5166710441 15500131323