Search a number
-
+
12020020110 = 2345723611511
BaseRepresentation
bin10110011000111001…
…01111001110001110
31011000200210021210000
423030130233032032
5144104111120420
65304422425130
7603603325260
oct131434571616
934020707700
1012020020110
115108a9601a
1223b55921a6
131197354147
1482054db30
154a53c7690
hex2cc72f38e

12020020110 has 320 divisors, whose sum is σ = 39201490944. Its totient is φ = 2583187200.

The previous prime is 12020020109. The next prime is 12020020147. The reversal of 12020020110 is 1102002021.

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 = 12020020092 and 12020020101.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 7954255 + ... + 7955765.

Almost surely, 212020020110 is an apocalyptic number.

12020020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 12020020110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19600745472).

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

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

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

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

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

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

Adding to 12020020110 its reverse (1102002021), we get a palindrome (13122022131).

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