Search a number
-
+
20011012110 = 2325222344579
BaseRepresentation
bin10010101000101111…
…111101000000001110
31220122121020202000200
4102220233331000032
5311440304341420
613105401234330
71305614540115
oct225057750016
956577222020
1020011012110
118539770641
123a657929a6
131b6ba6208b
14d7b950c7c
157c1be3b90
hex4a8bfd00e

20011012110 has 24 divisors (see below), whose sum is σ = 52028631720. Its totient is φ = 5336269872.

The previous prime is 20011012079. The next prime is 20011012157. The reversal of 20011012110 is 1121011002.

It is a happy number.

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 = 20011012092 and 20011012101.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 111172200 + ... + 111172379.

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

Almost surely, 220011012110 is an apocalyptic number.

20011012110 is an abundant number, since it is smaller than the sum of its proper divisors (32017619610).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 20011012110 its reverse (1121011002), we get a palindrome (21132023112).

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

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 222344579 444689158 667033737 1111722895 1334067474 2001101211 2223445790 3335168685 4002202422 6670337370 10005506055 20011012110