Search a number
-
+
11002101027 = 316272254067
BaseRepresentation
bin10100011111100011…
…01011110100100011
31001101202101122022020
422033301223310203
5140013014213102
65015421112523
7536433213201
oct121761536443
931352348266
1011002101027
114736443385
1221706b8743
1310644b1a68
1476529a071
15445d56bbc
hex28fc6bd23

11002101027 has 8 divisors (see below), whose sum is σ = 14678490816. Its totient is φ = 7330222632.

The previous prime is 11002101023. The next prime is 11002101041. The reversal of 11002101027 is 72010120011.

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

It is not a de Polignac number, because 11002101027 - 22 = 11002101023 is a prime.

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

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

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

Almost surely, 211002101027 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2255697.

The product of its (nonzero) digits is 28, while the sum is 15.

Adding to 11002101027 its reverse (72010120011), we get a palindrome (83012221038).

The spelling of 11002101027 in words is "eleven billion, two million, one hundred one thousand, twenty-seven".

Divisors: 1 3 1627 4881 2254067 6762201 3667367009 11002101027