Search a number
-
+
19551106110 = 2354331505089
BaseRepresentation
bin10010001101010101…
…100011010000111110
31212110112212002121010
4102031111203100332
5310020040343420
612552012020050
71261331442234
oct221525432076
955415762533
1019551106110
1183230a9438
123957761626
131ac76a7553
14d36834954
1579664a4e0
hex48d56343e

19551106110 has 32 divisors (see below), whose sum is σ = 47031052320. Its totient is φ = 5201584128.

The previous prime is 19551106109. The next prime is 19551106193. The reversal of 19551106110 is 1160115591.

It is a Harshad number since it is a multiple of its sum of digits (30).

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 739555 + ... + 765534.

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

Almost surely, 219551106110 is an apocalyptic number.

19551106110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

19551106110 is an abundant number, since it is smaller than the sum of its proper divisors (27479946210).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1505532.

The product of its (nonzero) digits is 1350, while the sum is 30.

The spelling of 19551106110 in words is "nineteen billion, five hundred fifty-one million, one hundred six thousand, one hundred ten".

Divisors: 1 2 3 5 6 10 15 30 433 866 1299 2165 2598 4330 6495 12990 1505089 3010178 4515267 7525445 9030534 15050890 22576335 45152670 651703537 1303407074 1955110611 3258517685 3910221222 6517035370 9775553055 19551106110