Search a number
-
+
11120001013 = 117313848071
BaseRepresentation
bin10100101101100110…
…11011111111110101
31001200222020120200101
422112303123333311
5140233210013023
65035232114101
7542364310012
oct122663337765
931628216611
1011120001013
114796a50390
1221a4095931
131082a51b74
14776bca709
154513951ad
hex296cdbff5

11120001013 has 8 divisors (see below), whose sum is σ = 12297087936. Its totient is φ = 9970610400.

The previous prime is 11120000993. The next prime is 11120001023. The reversal of 11120001013 is 31010002111.

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

It is a cyclic number.

It is not a de Polignac number, because 11120001013 - 25 = 11120000981 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 (11120001023) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6923233 + ... + 6924838.

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

Almost surely, 211120001013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13848155.

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 11120001013 its reverse (31010002111), we get a palindrome (42130003124).

The spelling of 11120001013 in words is "eleven billion, one hundred twenty million, one thousand, thirteen".

Divisors: 1 11 73 803 13848071 152328781 1010909183 11120001013