Search a number
-
+
20000505000 = 233547672843
BaseRepresentation
bin10010101000000111…
…110111110010101000
31220121212110220222110
4102220013313302220
5311430112130000
613104344122320
71305426326130
oct225007676250
956555426873
1020000505000
118533844483
123a621663a0
131b69823758
14d7a3b7ac0
157c0d1a850
hex4a81f7ca8

20000505000 has 320 divisors, whose sum is σ = 72498792960. Its totient is φ = 4501728000.

The previous prime is 20000504987. The next prime is 20000505017. The reversal of 20000505000 is 50500002.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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 79 ways as a sum of consecutive naturals, for example, 7033579 + ... + 7036421.

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

Almost surely, 220000505000 is an apocalyptic number.

20000505000 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 20000505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36249396480).

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

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

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

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

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

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

The spelling of 20000505000 in words is "twenty billion, five hundred five thousand".