Search a number
-
+
20100210113 = 1031019191509
BaseRepresentation
bin10010101110000100…
…001101110111000001
31220212211002110200102
4102232010031313001
5312131123210423
613122305132145
71311046652444
oct225604156701
956784073612
1020100210113
1185850543a5
123a8b62a055
131b84392c69
14d8972d65b
157c9962c28
hex4ae10ddc1

20100210113 has 8 divisors (see below), whose sum is σ = 20315380800. Its totient is φ = 19885424688.

The previous prime is 20100210103. The next prime is 20100210127. The reversal of 20100210113 is 31101200102.

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 20100210113 - 212 = 20100206017 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 220100210113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 192631.

The product of its (nonzero) digits is 12, while the sum is 11.

Adding to 20100210113 its reverse (31101200102), we get a palindrome (51201410215).

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

Divisors: 1 103 1019 104957 191509 19725427 195147671 20100210113