Search a number
-
+
21026563500 = 2235337439863
BaseRepresentation
bin10011100101010001…
…111110010110101100
32000021101012002122010
4103211101332112230
5321030300013000
613354240121220
71343025561255
oct234521762654
960241162563
1021026563500
118a0aa46408
1240a9906210
131ca1285867
141036789b2c
15830e47d50
hex4e547e5ac

21026563500 has 192 divisors, whose sum is σ = 63100477440. Its totient is φ = 5436806400.

The previous prime is 21026563469. The next prime is 21026563511. The reversal of 21026563500 is 536562012.

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

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 63 ways as a sum of consecutive naturals, for example, 24364069 + ... + 24364931.

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

Almost surely, 221026563500 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 30.

The spelling of 21026563500 in words is "twenty-one billion, twenty-six million, five hundred sixty-three thousand, five hundred".