Search a number
-
+
20102112000 = 283253223313
BaseRepresentation
bin10010101110001011…
…011110001100000000
31220212221200002120200
4102232023132030000
5312132120041000
613122414005200
71311102063345
oct225613361400
956787602520
1020102112000
118586133303
123a901a6800
131b848aa839
14d89aa67cc
157c9bdb500
hex4ae2de300

20102112000 has 432 divisors, whose sum is σ = 72889759488. Its totient is φ = 5319475200.

The previous prime is 20102111969. The next prime is 20102112007. The reversal of 20102112000 is 21120102.

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 64223844 + ... + 64224156.

Almost surely, 220102112000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 20102112000 its reverse (21120102), we get a palindrome (20123232102).

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