Search a number
-
+
145133016565 = 5231262026231
BaseRepresentation
bin1000011100101010011…
…0100001010111110101
3111212121120101010201211
42013022212201113311
54334213023012230
6150401224121421
713325350200115
oct2071246412765
9455546333654
10145133016565
1156606893499
1224164906271
13108bc1543c4
14704b237045
153b966a042a
hex21ca9a15f5

145133016565 has 8 divisors (see below), whose sum is σ = 181731777408. Its totient is φ = 111058308240.

The previous prime is 145133016529. The next prime is 145133016569. The reversal of 145133016565 is 565610331541.

145133016565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 145133016565 - 29 = 145133016053 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2145133016565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1262026259.

The product of its (nonzero) digits is 162000, while the sum is 40.

The spelling of 145133016565 in words is "one hundred forty-five billion, one hundred thirty-three million, sixteen thousand, five hundred sixty-five".

Divisors: 1 5 23 115 1262026231 6310131155 29026603313 145133016565