Search a number
-
+
440653703051 = 1014362907951
BaseRepresentation
bin1100110100110010000…
…00011110011110001011
31120010101220200110111102
412122121000132132023
524204424321444201
6534233350052015
743556544450422
oct6323100363613
91503356613442
10440653703051
1115a9755891a1
127149a04a00b
1332726c70233
14174834d62b9
15b6e09aa26b
hex669901e78b

440653703051 has 4 divisors (see below), whose sum is σ = 445016611104. Its totient is φ = 436290795000.

The previous prime is 440653703027. The next prime is 440653703069. The reversal of 440653703051 is 150307356044.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 440653703051 - 26 = 440653702987 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (440653703551) 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, 2181453875 + ... + 2181454076.

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

Almost surely, 2440653703051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4362908052.

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

The spelling of 440653703051 in words is "four hundred forty billion, six hundred fifty-three million, seven hundred three thousand, fifty-one".

Divisors: 1 101 4362907951 440653703051