Base | Representation |
---|---|
bin | 1001101011111100110010… |
… | …00010001001111111100011 |
3 | 2210102101101221101002202101 |
4 | 10311332121002021333203 |
5 | 10243000040414101011 |
6 | 113145404210031231 |
7 | 4325653220043301 |
oct | 465763102117743 |
9 | 83371357332671 |
10 | 21301310300131 |
11 | 68729203820a4 |
12 | 2480405878517 |
13 | bb69219b14a4 |
14 | 538dbb849271 |
15 | 26e168d332c1 |
hex | 135f99089fe3 |
21301310300131 has 2 divisors, whose sum is σ = 21301310300132. Its totient is φ = 21301310300130.
The previous prime is 21301310300129. The next prime is 21301310300143. The reversal of 21301310300131 is 13100301310312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21301310300131 - 21 = 21301310300129 is a prime.
It is a super-2 number, since 2×213013103001312 (a number of 27 digits) contains 22 as substring.
Together with 21301310300129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 21301310300099 and 21301310300108.
It is not a weakly prime, because it can be changed into another prime (21301310300161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10650655150065 + 10650655150066.
It is an arithmetic number, because the mean of its divisors is an integer number (10650655150066).
Almost surely, 221301310300131 is an apocalyptic number.
21301310300131 is a deficient number, since it is larger than the sum of its proper divisors (1).
21301310300131 is an equidigital number, since it uses as much as digits as its factorization.
21301310300131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 21301310300131 its reverse (13100301310312), we get a palindrome (34401611610443).
The spelling of 21301310300131 in words is "twenty-one trillion, three hundred one billion, three hundred ten million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •