Base | Representation |
---|---|
bin | 10011101111101011… |
… | …110010001011001001 |
3 | 2000201112121112202222 |
4 | 103233223302023021 |
5 | 321404440222023 |
6 | 13423433103425 |
7 | 1350245250404 |
oct | 235753621311 |
9 | 60645545688 |
10 | 21201101513 |
11 | 8a9a5183a9 |
12 | 4138257b75 |
13 | 1ccb4965a7 |
14 | 1051a20d3b |
15 | 841422cc8 |
hex | 4efaf22c9 |
21201101513 has 2 divisors, whose sum is σ = 21201101514. Its totient is φ = 21201101512.
The previous prime is 21201101479. The next prime is 21201101527. The reversal of 21201101513 is 31510110212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21109765264 + 91336249 = 145292^2 + 9557^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201101513 - 222 = 21196907209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21201101491 and 21201101500.
It is not a weakly prime, because it can be changed into another prime (21201101563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600550756 + 10600550757.
It is an arithmetic number, because the mean of its divisors is an integer number (10600550757).
Almost surely, 221201101513 is an apocalyptic number.
It is an amenable number.
21201101513 is a deficient number, since it is larger than the sum of its proper divisors (1).
21201101513 is an equidigital number, since it uses as much as digits as its factorization.
21201101513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 21201101513 its reverse (31510110212), we get a palindrome (52711211725).
The spelling of 21201101513 in words is "twenty-one billion, two hundred one million, one hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •