Search a number
-
+
1315161065 = 57312912791
BaseRepresentation
bin100111001100011…
…1100001111101001
310101122201002211002
41032120330033221
510143140123230
6334300244345
744406453551
oct11630741751
93348632732
101315161065
11615412a79
123085406b5
1317c615a1a
14c694a161
157a6d7545
hex4e63c3e9

1315161065 has 16 divisors (see below), whose sum is σ = 1601625216. Its totient is φ = 1036540800.

The previous prime is 1315161053. The next prime is 1315161161. The reversal of 1315161065 is 5601615131.

It is not a de Polignac number, because 1315161065 - 28 = 1315160809 is a prime.

It is a Duffinian 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 15 ways as a sum of consecutive naturals, for example, 469820 + ... + 472610.

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

Almost surely, 21315161065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4160.

The product of its (nonzero) digits is 2700, while the sum is 29.

The square root of 1315161065 is about 36265.1494550898. The cubic root of 1315161065 is about 1095.6192337185.

Adding to 1315161065 its reverse (5601615131), we get a palindrome (6916776196).

The spelling of 1315161065 in words is "one billion, three hundred fifteen million, one hundred sixty-one thousand, sixty-five".

Divisors: 1 5 73 365 1291 2791 6455 13955 94243 203743 471215 1018715 3603181 18015905 263032213 1315161065