Search a number
-
+
15314255131 = 721063294013
BaseRepresentation
bin11100100001100110…
…01111110100011011
31110112021110202200111
432100303033310123
5222330422131011
611011341345151
71051334010100
oct162063176433
943467422614
1015314255131
1165495525aa
122b748681b7
1315a0998436
14a53c68aa7
155e96dc121
hex390ccfd1b

15314255131 has 12 divisors (see below), whose sum is σ = 17831361072. Its totient is φ = 13114111248.

The previous prime is 15314255123. The next prime is 15314255153. The reversal of 15314255131 is 13155241351.

It is not a de Polignac number, because 15314255131 - 23 = 15314255123 is a prime.

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

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

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94920 + ... + 199093.

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

Almost surely, 215314255131 is an apocalyptic number.

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

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

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

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

The product of its digits is 9000, while the sum is 31.

Adding to 15314255131 its reverse (13155241351), we get a palindrome (28469496482).

The spelling of 15314255131 in words is "fifteen billion, three hundred fourteen million, two hundred fifty-five thousand, one hundred thirty-one".

Divisors: 1 7 49 1063 7441 52087 294013 2058091 14406637 312535819 2187750733 15314255131