Base | Representation |
---|---|
bin | 1001110001101111000101… |
… | …00110101100100001010001 |
3 | 2211010101112211221021200002 |
4 | 10320313202212230201101 |
5 | 10304224212424023441 |
6 | 113421003212135345 |
7 | 4346221563050321 |
oct | 470674246544121 |
9 | 84111484837602 |
10 | 21500113111121 |
11 | 693a168387497 |
12 | 24b2a48467555 |
13 | bcc5b4c817a8 |
14 | 54487a92d281 |
15 | 274402124b9b |
hex | 138de29ac851 |
21500113111121 has 8 divisors (see below), whose sum is σ = 21635943782400. Its totient is φ = 21364524780160.
The previous prime is 21500113111097. The next prime is 21500113111163. The reversal of 21500113111121 is 12111131100512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21500113111121 - 226 = 21500046002257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21500113111093 and 21500113111102.
It is not an unprimeable number, because it can be changed into a prime (21500113111921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60407081 + ... + 60761958.
It is an arithmetic number, because the mean of its divisors is an integer number (2704492972800).
Almost surely, 221500113111121 is an apocalyptic number.
It is an amenable number.
21500113111121 is a deficient number, since it is larger than the sum of its proper divisors (135830671279).
21500113111121 is a wasteful number, since it uses less digits than its factorization.
21500113111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121170159.
The product of its (nonzero) digits is 60, while the sum is 20.
Adding to 21500113111121 its reverse (12111131100512), we get a palindrome (33611244211633).
The spelling of 21500113111121 in words is "twenty-one trillion, five hundred billion, one hundred thirteen million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •