Base | Representation |
---|---|
bin | 1001100111010001010011… |
… | …00000001101011001111001 |
3 | 2202212000101120002212021102 |
4 | 10303220221200031121321 |
5 | 10232331243441342111 |
6 | 112543453454221145 |
7 | 4311231632324354 |
oct | 463505140153171 |
9 | 82760346085242 |
10 | 21140525340281 |
11 | 6810712470a96 |
12 | 24552131b47b5 |
13 | ba4709c296a9 |
14 | 5312c79a329b |
15 | 269da84e013b |
hex | 133a2980d679 |
21140525340281 has 2 divisors, whose sum is σ = 21140525340282. Its totient is φ = 21140525340280.
The previous prime is 21140525340271. The next prime is 21140525340331. The reversal of 21140525340281 is 18204352504112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12643393620025 + 8497131720256 = 3555755^2 + 2914984^2 .
It is a cyclic number.
It is not a de Polignac number, because 21140525340281 - 218 = 21140525078137 is a prime.
It is a super-2 number, since 2×211405253402812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21140525340271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10570262670140 + 10570262670141.
It is an arithmetic number, because the mean of its divisors is an integer number (10570262670141).
Almost surely, 221140525340281 is an apocalyptic number.
It is an amenable number.
21140525340281 is a deficient number, since it is larger than the sum of its proper divisors (1).
21140525340281 is an equidigital number, since it uses as much as digits as its factorization.
21140525340281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76800, while the sum is 38.
Adding to 21140525340281 its reverse (18204352504112), we get a palindrome (39344877844393).
The spelling of 21140525340281 in words is "twenty-one trillion, one hundred forty billion, five hundred twenty-five million, three hundred forty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •