Base | Representation |
---|---|
bin | 1001110001110011100110… |
… | …11101100001000111110101 |
3 | 2211010121211012221211021102 |
4 | 10320321303131201013311 |
5 | 10304244202102321321 |
6 | 113422044305455445 |
7 | 4346336033142023 |
oct | 470716335410765 |
9 | 84117735854242 |
10 | 21502543401461 |
11 | 69401a51a8601 |
12 | 24b3406341585 |
13 | bcc8b1614605 |
14 | 544a2b5d5713 |
15 | 2744e5680c0b |
hex | 138e737611f5 |
21502543401461 has 2 divisors, whose sum is σ = 21502543401462. Its totient is φ = 21502543401460.
The previous prime is 21502543401359. The next prime is 21502543401463. The reversal of 21502543401461 is 16410434520512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15389811310225 + 6112732091236 = 3922985^2 + 2472394^2 .
It is a cyclic number.
It is not a de Polignac number, because 21502543401461 - 218 = 21502543139317 is a prime.
Together with 21502543401463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21502543401463) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10751271700730 + 10751271700731.
It is an arithmetic number, because the mean of its divisors is an integer number (10751271700731).
Almost surely, 221502543401461 is an apocalyptic number.
It is an amenable number.
21502543401461 is a deficient number, since it is larger than the sum of its proper divisors (1).
21502543401461 is an equidigital number, since it uses as much as digits as its factorization.
21502543401461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 21502543401461 its reverse (16410434520512), we get a palindrome (37912977921973).
The spelling of 21502543401461 in words is "twenty-one trillion, five hundred two billion, five hundred forty-three million, four hundred one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •