Search a number
-
+
10919555153 = 13839965781
BaseRepresentation
bin10100010101101101…
…10011000001010001
31001012000001212122122
422022312303001101
5134330401231103
65003311544025
7534411454523
oct121266630121
931160055578
1010919555153
1146a3893451
122148b2b015
13105036c950
1475832da13
1543d99db38
hex28adb3051

10919555153 has 4 divisors (see below), whose sum is σ = 11759520948. Its totient is φ = 10079589360.

The previous prime is 10919555137. The next prime is 10919555191. The reversal of 10919555153 is 35155591901.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35155591901 = 41857453461.

It can be written as a sum of positive squares in 2 ways, for example, as 2468797969 + 8450757184 = 49687^2 + 91928^2 .

It is a cyclic number.

It is not a de Polignac number, because 10919555153 - 24 = 10919555137 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 210919555153 is an apocalyptic number.

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

It is an amenable number.

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

10919555153 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 839965794.

The product of its (nonzero) digits is 151875, while the sum is 44.

The spelling of 10919555153 in words is "ten billion, nine hundred nineteen million, five hundred fifty-five thousand, one hundred fifty-three".

Divisors: 1 13 839965781 10919555153