Base | Representation |
---|---|
bin | 10100001101101000… |
… | …101011001101101010 |
3 | 2002000120011021022000 |
4 | 110031220223031222 |
5 | 323422110244200 |
6 | 13545343311430 |
7 | 1365556403433 |
oct | 241550531552 |
9 | 62016137260 |
10 | 21703603050 |
11 | 9228133228 |
12 | 42585ab576 |
13 | 207b61618c |
14 | 109c66848a |
15 | 8705d2300 |
hex | 50da2b36a |
21703603050 has 96 divisors (see below), whose sum is σ = 60648082560. Its totient is φ = 5706086400.
The previous prime is 21703603039. The next prime is 21703603109. The reversal of 21703603050 is 5030630712.
It is a happy number.
21703603050 is a `hidden beast` number, since 2 + 1 + 7 + 0 + 3 + 603 + 0 + 50 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 47 ways as a sum of consecutive naturals, for example, 17367 + ... + 209066.
It is an arithmetic number, because the mean of its divisors is an integer number (631750860).
Almost surely, 221703603050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21703603050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30324041280).
21703603050 is an abundant number, since it is smaller than the sum of its proper divisors (38944479510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21703603050 is a wasteful number, since it uses less digits than its factorization.
21703603050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226525 (or 226514 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The spelling of 21703603050 in words is "twenty-one billion, seven hundred three million, six hundred three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •