Search a number
-
+
5492465709 = 31830821903
BaseRepresentation
bin1010001110110000…
…00110000000101101
3112011210001011111220
411013120012000231
542222032400314
62305002333553
7253052121363
oct50730060055
915153034456
105492465709
112369398865
1210934ba2b9
13696ba6513
143a1655633
152222d23a9
hex14760602d

5492465709 has 4 divisors (see below), whose sum is σ = 7323287616. Its totient is φ = 3661643804.

The previous prime is 5492465707. The next prime is 5492465743. The reversal of 5492465709 is 9075642945.

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 5492465709 - 21 = 5492465707 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 915410949 + ... + 915410954.

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

Almost surely, 25492465709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1830821906.

The product of its (nonzero) digits is 2721600, while the sum is 51.

The square root of 5492465709 is about 74111.1712834172. The cubic root of 5492465709 is about 1764.3677789804.

The spelling of 5492465709 in words is "five billion, four hundred ninety-two million, four hundred sixty-five thousand, seven hundred nine".

Divisors: 1 3 1830821903 5492465709