Search a number
-
+
20000110113 = 331559475141
BaseRepresentation
bin10010101000000110…
…010111011000100001
31220121211201212022000
4102220012113120201
5311430012010423
613104331434213
71305423062634
oct225006273041
956554655260
1020000110113
1185335a4825
123a61bb5969
131b69715aa9
14d7a313c1b
157c0c8d843
hex4a8197621

20000110113 has 16 divisors (see below), whose sum is σ = 29648860800. Its totient is φ = 13324826160.

The previous prime is 20000110099. The next prime is 20000110121. The reversal of 20000110113 is 31101100002.

It is not a de Polignac number, because 20000110113 - 210 = 20000109089 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

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

Almost surely, 220000110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 476709 (or 476703 counting only the distinct ones).

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

Adding to 20000110113 its reverse (31101100002), we get a palindrome (51101210115).

The spelling of 20000110113 in words is "twenty billion, one hundred ten thousand, one hundred thirteen".

Divisors: 1 3 9 27 1559 4677 14031 42093 475141 1425423 4276269 12828807 740744819 2222234457 6666703371 20000110113