Search a number
-
+
1450655513 = 4903295871
BaseRepresentation
bin101011001110111…
…0011111100011001
310202002122221020222
41112131303330121
510432331434023
6355540325425
750643240236
oct12635637431
93662587228
101450655513
11684947a5a
123459a3875
131a1706358
14da93a78d
158754dcc8
hex56773f19

1450655513 has 4 divisors (see below), whose sum is σ = 1450956288. Its totient is φ = 1450354740.

The previous prime is 1450655483. The next prime is 1450655519. The reversal of 1450655513 is 3155560541.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1450655513 - 214 = 1450639129 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 21450655513 is an apocalyptic number.

It is an amenable number.

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

1450655513 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 300774.

The product of its (nonzero) digits is 45000, while the sum is 35.

The square root of 1450655513 is about 38087.4718641183. The cubic root of 1450655513 is about 1132.0217319160.

The spelling of 1450655513 in words is "one billion, four hundred fifty million, six hundred fifty-five thousand, five hundred thirteen".

Divisors: 1 4903 295871 1450655513