Search a number
-
+
134615206065 = 3513765506183
BaseRepresentation
bin111110101011110110…
…0010000100010110001
3110212110120021000010210
41331113230100202301
54201142443043230
6141501423014333
712503614241424
oct1752754204261
9425416230123
10134615206065
11520a985781a
122210a43a3a9
13c9040b71b2
1467304039bb
15377d10beb0
hex1f57b108b1

134615206065 has 16 divisors (see below), whose sum is σ = 216956481408. Its totient is φ = 71270726016.

The previous prime is 134615206049. The next prime is 134615206067. The reversal of 134615206065 is 560602516431.

It is not a de Polignac number, because 134615206065 - 24 = 134615206049 is a prime.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (134615206067) 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 15 ways as a sum of consecutive naturals, for example, 32751037 + ... + 32755146.

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

Almost surely, 2134615206065 is an apocalyptic number.

134615206065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 65506328.

The product of its (nonzero) digits is 129600, while the sum is 39.

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

Divisors: 1 3 5 15 137 411 685 2055 65506183 196518549 327530915 982592745 8974347071 26923041213 44871735355 134615206065