Search a number
-
+
1450505765 = 51231235663
BaseRepresentation
bin101011001110100…
…1111011000100101
310202002101022211202
41112131033120211
510432312141030
6355533212245
750642044532
oct12635173045
93662338752
101450505765
116848554a5
12345931085
131a1683147
14da8dbd89
158751e745
hex5674f625

1450505765 has 8 divisors (see below), whose sum is σ = 1742028288. Its totient is φ = 1159457040.

The previous prime is 1450505747. The next prime is 1450505767. The reversal of 1450505765 is 5675050541.

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

It is not a de Polignac number, because 1450505765 - 28 = 1450505509 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 (1450505767) 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, 111677 + ... + 123986.

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

Almost surely, 21450505765 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 236899.

The product of its (nonzero) digits is 105000, while the sum is 38.

The square root of 1450505765 is about 38085.5059701194. The cubic root of 1450505765 is about 1131.9827785320.

The spelling of 1450505765 in words is "one billion, four hundred fifty million, five hundred five thousand, seven hundred sixty-five".

Divisors: 1 5 1231 6155 235663 1178315 290101153 1450505765