Search a number
-
+
145050125433 = 3431124419577
BaseRepresentation
bin1000011100010110101…
…0010100010001111001
3111212101210101211110220
42013011222110101321
54334030313003213
6150345103330253
713323322503033
oct2070552242171
9455353354426
10145050125433
1156574018124
1224140bb0989
13108a7c210b5
14704021ac53
153b8e279e23
hex21c5a94479

145050125433 has 8 divisors (see below), whose sum is σ = 197897845728. Its totient is φ = 94451244384.

The previous prime is 145050125399. The next prime is 145050125447. The reversal of 145050125433 is 334521050541.

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

It is not a de Polignac number, because 145050125433 - 210 = 145050124409 is a prime.

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

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

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, 562209660 + ... + 562209917.

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

Almost surely, 2145050125433 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1124419623.

The product of its (nonzero) digits is 36000, while the sum is 33.

Adding to 145050125433 its reverse (334521050541), we get a palindrome (479571175974).

The spelling of 145050125433 in words is "one hundred forty-five billion, fifty million, one hundred twenty-five thousand, four hundred thirty-three".

Divisors: 1 3 43 129 1124419577 3373258731 48350041811 145050125433