Base | Representation |
---|---|
bin | 1001110000110111010000… |
… | …10001110010000110001001 |
3 | 2211000112012012212101000202 |
4 | 10320123220101302012021 |
5 | 10303231323220134121 |
6 | 113355125303541545 |
7 | 4344111112535426 |
oct | 470335021620611 |
9 | 84015165771022 |
10 | 21470143521161 |
11 | 6928489323a25 |
12 | 24a908375a8b5 |
13 | bc9819ca61ca |
14 | 54323655cd4d |
15 | 27374b00640b |
hex | 1386e8472189 |
21470143521161 has 2 divisors, whose sum is σ = 21470143521162. Its totient is φ = 21470143521160.
The previous prime is 21470143521031. The next prime is 21470143521209. The reversal of 21470143521161 is 16112534107412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19511700012025 + 1958443509136 = 4417205^2 + 1399444^2 .
It is a cyclic number.
It is not a de Polignac number, because 21470143521161 - 218 = 21470143259017 is a prime.
It is not a weakly prime, because it can be changed into another prime (21470143521361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10735071760580 + 10735071760581.
It is an arithmetic number, because the mean of its divisors is an integer number (10735071760581).
Almost surely, 221470143521161 is an apocalyptic number.
It is an amenable number.
21470143521161 is a deficient number, since it is larger than the sum of its proper divisors (1).
21470143521161 is an equidigital number, since it uses as much as digits as its factorization.
21470143521161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
Adding to 21470143521161 its reverse (16112534107412), we get a palindrome (37582677628573).
The spelling of 21470143521161 in words is "twenty-one trillion, four hundred seventy billion, one hundred forty-three million, five hundred twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •