Base | Representation |
---|---|
bin | 1001110001101111110011… |
… | …10110100110000101100001 |
3 | 2211010102120000212120100012 |
4 | 10320313321312212011201 |
5 | 10304231012301430131 |
6 | 113421110024134305 |
7 | 4346234340264521 |
oct | 470677166460541 |
9 | 84112500776305 |
10 | 21500503155041 |
11 | 693a348572239 |
12 | 24b2b37007395 |
13 | bcc647a18501 |
14 | 5448b6661681 |
15 | 2744264bd52b |
hex | 138df9da6161 |
21500503155041 has 2 divisors, whose sum is σ = 21500503155042. Its totient is φ = 21500503155040.
The previous prime is 21500503155031. The next prime is 21500503155049. The reversal of 21500503155041 is 14055130500512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21372092016016 + 128411139025 = 4622996^2 + 358345^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21500503155041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21500503154989 and 21500503155007.
It is not a weakly prime, because it can be changed into another prime (21500503155049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10750251577520 + 10750251577521.
It is an arithmetic number, because the mean of its divisors is an integer number (10750251577521).
Almost surely, 221500503155041 is an apocalyptic number.
It is an amenable number.
21500503155041 is a deficient number, since it is larger than the sum of its proper divisors (1).
21500503155041 is an equidigital number, since it uses as much as digits as its factorization.
21500503155041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15000, while the sum is 32.
Adding to 21500503155041 its reverse (14055130500512), we get a palindrome (35555633655553).
The spelling of 21500503155041 in words is "twenty-one trillion, five hundred billion, five hundred three million, one hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •