Search a number
-
+
1105000401113 = 77571383115077
BaseRepresentation
bin10000000101000111001…
…010000000100011011001
310220122012101012110111222
4100011013022000203121
5121101020100313423
62203344041301425
7142555640302310
oct20050712004331
93818171173458
101105000401113
1139669aa123a4
1215a1a6494875
138027ca475bb
143b6a7631277
151db249863c8
hex101472808d9

1105000401113 has 16 divisors (see below), whose sum is σ = 1264701145344. Its totient is φ = 945760898880.

The previous prime is 1105000401067. The next prime is 1105000401119. The reversal of 1105000401113 is 3111040005011.

It is not a de Polignac number, because 1105000401113 - 26 = 1105000401049 is a prime.

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

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

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

Almost surely, 21105000401113 is an apocalyptic number.

It is an amenable number.

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

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

1105000401113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 29672.

The product of its (nonzero) digits is 60, while the sum is 17.

Adding to 1105000401113 its reverse (3111040005011), we get a palindrome (4216040406124).

The spelling of 1105000401113 in words is "one trillion, one hundred five billion, four hundred one thousand, one hundred thirteen".

Divisors: 1 7 757 5299 13831 15077 96817 105539 10470067 11413289 73290469 79893023 208529987 1459709909 157857200159 1105000401113