5909150641 has 3 divisors (see below), whose sum is σ = 5909227513. Its totient is φ = 5909073770.

The previous prime is 5909150633. The next prime is 5909150647. The reversal of 5909150641 is 1460519095.

The square root of 5909150641 is 76871.

It is a perfect power (a square), and thus also a powerful number.

5909150641 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.

It is not a de Polignac number, because 5909150641 - 2³ = 5909150633 is a prime.

It is a super-2 number, since 2×5909150641² = 69836122596061421762, which contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 2^5909150641 is an apocalyptic number.

5909150641 is the 76871-st square number.

5909150641 is the 38436-th centered octagonal number.

It is an amenable number.

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

5909150641 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 153742 (or 76871 counting only the distinct ones).

The product of its (nonzero) digits is 48600, while the sum is 40.

The cubic root of 5909150641 is about 1807.9025632458.

The spelling of 5909150641 in words is "five billion, nine hundred nine million, one hundred fifty thousand, six hundred forty-one".