Base | Representation |
---|---|
bin | 1001110001110001111011… |
… | …10011100111001111110010 |
3 | 2211010112111111010002000022 |
4 | 10320320331303213033302 |
5 | 10304240331131132200 |
6 | 113421415111523442 |
7 | 4346304522564053 |
oct | 470707563471762 |
9 | 84115444102008 |
10 | 21501643224050 |
11 | 693a883064a30 |
12 | 24b31b4989582 |
13 | bcc799c88262 |
14 | 544983c3072a |
15 | 27449161b885 |
hex | 138e3dce73f2 |
21501643224050 has 48 divisors (see below), whose sum is σ = 43633858004352. Its totient is φ = 7817870894400.
The previous prime is 21501643224049. The next prime is 21501643224053. The reversal of 21501643224050 is 5042234610512.
It is a super-2 number, since 2×215016432240502 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21501643224050.
It is not an unprimeable number, because it can be changed into a prime (21501643224053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2475812 + ... + 7009488.
It is an arithmetic number, because the mean of its divisors is an integer number (909038708424).
Almost surely, 221501643224050 is an apocalyptic number.
21501643224050 is an abundant number, since it is smaller than the sum of its proper divisors (22132214780302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21501643224050 is a wasteful number, since it uses less digits than its factorization.
21501643224050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4542323 (or 4542318 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 21501643224050 its reverse (5042234610512), we get a palindrome (26543877834562).
The spelling of 21501643224050 in words is "twenty-one trillion, five hundred one billion, six hundred forty-three million, two hundred twenty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •