Base | Representation |
---|---|
bin | 1001101110110100110110… |
… | …01110110100111110011101 |
3 | 2210202211110221202100011222 |
4 | 10313122123032310332131 |
5 | 10301104432121033112 |
6 | 113303030141423125 |
7 | 4336052130533513 |
oct | 467323316647635 |
9 | 83684427670158 |
10 | 21400131424157 |
11 | 690082131a232 |
12 | 24975a486aaa5 |
13 | bc30401b4685 |
14 | 53dab40b84b3 |
15 | 2719ee806372 |
hex | 13769b3b4f9d |
21400131424157 has 2 divisors, whose sum is σ = 21400131424158. Its totient is φ = 21400131424156.
The previous prime is 21400131424109. The next prime is 21400131424159. The reversal of 21400131424157 is 75142413100412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21086519104036 + 313612320121 = 4592006^2 + 560011^2 .
It is a cyclic number.
It is not a de Polignac number, because 21400131424157 - 28 = 21400131423901 is a prime.
Together with 21400131424159, 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 (21400131424159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10700065712078 + 10700065712079.
It is an arithmetic number, because the mean of its divisors is an integer number (10700065712079).
Almost surely, 221400131424157 is an apocalyptic number.
It is an amenable number.
21400131424157 is a deficient number, since it is larger than the sum of its proper divisors (1).
21400131424157 is an equidigital number, since it uses as much as digits as its factorization.
21400131424157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26880, while the sum is 35.
Adding to 21400131424157 its reverse (75142413100412), we get a palindrome (96542544524569).
The spelling of 21400131424157 in words is "twenty-one trillion, four hundred billion, one hundred thirty-one million, four hundred twenty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •