Search a number
-
+
20010110101 = 235683153089
BaseRepresentation
bin10010101000101100…
…100000110010010101
31220122112112220200221
4102220230200302111
5311440042010401
613105330034341
71305604062262
oct225054406225
956575486627
1020010110101
118539204983
123a654189b1
131b6b807647
14d7b798269
157c1ab67a1
hex4a8b20c95

20010110101 has 8 divisors (see below), whose sum is σ = 20883925440. Its totient is φ = 19136612352.

The previous prime is 20010110047. The next prime is 20010110137. The reversal of 20010110101 is 10101101002.

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

It is not a de Polignac number, because 20010110101 - 29 = 20010109589 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 (20010110161) 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, 54165 + ... + 207253.

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

Almost surely, 220010110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 158795.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 20010110101 its reverse (10101101002), we get a palindrome (30111211103).

Subtracting from 20010110101 its reverse (10101101002), we obtain a palindrome (9909009099).

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

Divisors: 1 23 5683 130709 153089 3521047 870004787 20010110101