Search a number
-
+
11110000560001 = 719197342338489
BaseRepresentation
bin1010000110101011111110…
…1000110000011110000001
31110100002212001010002212021
42201222333220300132001
52424011240120410001
635343510325201441
72224446112415410
oct241527750603601
943302761102767
1011110000560001
1135a37a7751832
1212b5238860281
1362788ca88b05
142a5a26863477
15143ee3862ba1
hexa1abfa30781

11110000560001 has 16 divisors (see below), whose sum is σ = 13372188681600. Its totient is φ = 9017081820288.

The previous prime is 11110000559993. The next prime is 11110000560011. The reversal of 11110000560001 is 10006500001111.

It is a cyclic number.

It is not a de Polignac number, because 11110000560001 - 23 = 11110000559993 is a prime.

It is a super-2 number, since 2×111100005600012 (a number of 27 digits) contains 22 as substring.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20906836 + ... + 21431653.

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

Almost surely, 211110000560001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 42340488.

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

Adding to 11110000560001 its reverse (10006500001111), we get a palindrome (21116500561112).

The spelling of 11110000560001 in words is "eleven trillion, one hundred ten billion, five hundred sixty thousand, one".

Divisors: 1 7 19 133 1973 13811 37487 262409 42338489 296369423 804431291 5631019037 83533838797 584736871579 1587142937143 11110000560001