Search a number
-
+
31415050565 = 525037250949
BaseRepresentation
bin11101010000011110…
…111010000101000101
310000002100221220211022
4131100132322011011
51003314223104230
622233141320525
72161331344463
oct352036720505
9100070856738
1031415050565
1112360a82508
126108a06145
132c685b3222
141740357833
15c3ce931e5
hex7507ba145

31415050565 has 8 divisors (see below), whose sum is σ = 37699716600. Its totient is φ = 25130936512.

The previous prime is 31415050529. The next prime is 31415050637. The reversal of 31415050565 is 56505051413.

It can be written as a sum of positive squares in 4 ways, for example, as 927446116 + 30487604449 = 30454^2 + 174607^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 31415050565 - 28 = 31415050309 is a prime.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 290 + ... + 250659.

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

Almost surely, 231415050565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 275991.

The product of its (nonzero) digits is 45000, while the sum is 35.

The spelling of 31415050565 in words is "thirty-one billion, four hundred fifteen million, fifty thousand, five hundred sixty-five".

Divisors: 1 5 25037 125185 250949 1254745 6283010113 31415050565