Base | Representation |
---|---|
bin | 1001110001101110111011… |
… | …01001110101111110101100 |
3 | 2211010101100001122100112102 |
4 | 10320313131221311332230 |
5 | 10304224030143101340 |
6 | 113420551043554232 |
7 | 4346216534045261 |
oct | 470673551657654 |
9 | 84111301570472 |
10 | 21500030050220 |
11 | 693a125505617 |
12 | 24b2a2468b978 |
13 | bcc5a09bc127 |
14 | 54486d8ab268 |
15 | 2743e9bb9215 |
hex | 138ddda75fac |
21500030050220 has 48 divisors (see below), whose sum is σ = 45893367928128. Its totient is φ = 8458449442560.
The previous prime is 21500030050201. The next prime is 21500030050237. The reversal of 21500030050220 is 2205003000512.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 21500030050192 and 21500030050201.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17456849 + ... + 18647831.
It is an arithmetic number, because the mean of its divisors is an integer number (956111831836).
Almost surely, 221500030050220 is an apocalyptic number.
21500030050220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21500030050220 is an abundant number, since it is smaller than the sum of its proper divisors (24393337877908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21500030050220 is a wasteful number, since it uses less digits than its factorization.
21500030050220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1205850 (or 1205848 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 20.
Adding to 21500030050220 its reverse (2205003000512), we get a palindrome (23705033050732).
The spelling of 21500030050220 in words is "twenty-one trillion, five hundred billion, thirty million, fifty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •