Base | Representation |
---|---|
bin | 1001110001110011100110… |
… | …11100100001000111010001 |
3 | 2211010121211012110111122001 |
4 | 10320321303130201013101 |
5 | 10304244202020424111 |
6 | 113422044300114001 |
7 | 4346336031000451 |
oct | 470716334410721 |
9 | 84117735414561 |
10 | 21502543139281 |
11 | 69401a5039626 |
12 | 24b3406235901 |
13 | bcc8b1552189 |
14 | 544a2b567d61 |
15 | 2744e562d1c1 |
hex | 138e737211d1 |
21502543139281 has 2 divisors, whose sum is σ = 21502543139282. Its totient is φ = 21502543139280.
The previous prime is 21502543139263. The next prime is 21502543139291. The reversal of 21502543139281 is 18293134520512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18435172704400 + 3067370434881 = 4293620^2 + 1751391^2 .
It is a cyclic number.
It is not a de Polignac number, because 21502543139281 - 223 = 21502534750673 is a prime.
It is a super-2 number, since 2×215025431392812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21502543139221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10751271569640 + 10751271569641.
It is an arithmetic number, because the mean of its divisors is an integer number (10751271569641).
Almost surely, 221502543139281 is an apocalyptic number.
It is an amenable number.
21502543139281 is a deficient number, since it is larger than the sum of its proper divisors (1).
21502543139281 is an equidigital number, since it uses as much as digits as its factorization.
21502543139281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 518400, while the sum is 46.
Adding to 21502543139281 its reverse (18293134520512), we get a palindrome (39795677659793).
The spelling of 21502543139281 in words is "twenty-one trillion, five hundred two billion, five hundred forty-three million, one hundred thirty-nine thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •