Search a number
-
+
11002005151 = 48892250359
BaseRepresentation
bin10100011111100010…
…10100011010011111
31001101202012202210021
422033301110122133
5140013003131101
65015415053011
7536432333524
oct121761243237
931352182707
1011002005151
114736388345
122170671167
13106447a227
1476527314b
15445d385a1
hex28fc5469f

11002005151 has 4 divisors (see below), whose sum is σ = 11004260400. Its totient is φ = 10999749904.

The previous prime is 11002005139. The next prime is 11002005163. The reversal of 11002005151 is 15150020011.

It is a semiprime because it is the product of two primes.

It is an interprime number because it is at equal distance from previous prime (11002005139) and next prime (11002005163).

It is a cyclic number.

It is not a de Polignac number, because 11002005151 - 213 = 11001996959 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211002005151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2255248.

The product of its (nonzero) digits is 50, while the sum is 16.

Adding to 11002005151 its reverse (15150020011), we get a palindrome (26152025162).

The spelling of 11002005151 in words is "eleven billion, two million, five thousand, one hundred fifty-one".

Divisors: 1 4889 2250359 11002005151