Search a number
-
+
110489654553 = 3141532602267
BaseRepresentation
bin110011011100110110…
…0100101010100011001
3101120012012210000010220
41212321230211110121
53302240322421203
6122431440430253
710661015365515
oct1467154452431
9346165700126
10110489654553
11429495908a3
12194b6918389
13a55aa9c125
1454c2245145
152d1a0ba653
hex19b9b25519

110489654553 has 8 divisors (see below), whose sum is σ = 147330005088. Its totient is φ = 73654536864.

The previous prime is 110489654519. The next prime is 110489654603. The reversal of 110489654553 is 355456984011.

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

It is not a de Polignac number, because 110489654553 - 212 = 110489650457 is a prime.

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

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

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

Almost surely, 2110489654553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2616423.

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

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

Divisors: 1 3 14153 42459 2602267 7806801 36829884851 110489654553