9110485641 has 8 divisors (see below), whose sum is σ = 12151744000. Its totient is φ = 6071442192.

The previous prime is 9110485639. The next prime is 9110485661. The reversal of 9110485641 is 1465840119.

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

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

It is not a de Polignac number, because 9110485641 - 2¹ = 9110485639 is a prime.

It is a super-2 number, since 2×9110485641² (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 9110485641.

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

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

Almost surely, 2^9110485641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1107455.

The product of its (nonzero) digits is 34560, while the sum is 39.

The square root of 9110485641 is about 95448.8640110504. The cubic root of 9110485641 is about 2088.5610571790.

The spelling of 9110485641 in words is "nine billion, one hundred ten million, four hundred eighty-five thousand, six hundred forty-one".