Base | Representation |
---|---|
bin | 1001101101011100001011… |
… | …01011011111110011000001 |
3 | 2210121021121012020121111001 |
4 | 10312232011223133303001 |
5 | 10244314432422404302 |
6 | 113225114211052001 |
7 | 4332445323363664 |
oct | 466560553376301 |
9 | 83537535217431 |
10 | 21352525200577 |
11 | 68926118a88aa |
12 | 248a3195a1001 |
13 | bbb6c43618cc |
14 | 53b6796676db |
15 | 2706651a8787 |
hex | 136b85adfcc1 |
21352525200577 has 2 divisors, whose sum is σ = 21352525200578. Its totient is φ = 21352525200576.
The previous prime is 21352525200491. The next prime is 21352525200581. The reversal of 21352525200577 is 77500252525312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19825148071936 + 1527377128641 = 4452544^2 + 1235871^2 .
It is a cyclic number.
It is not a de Polignac number, because 21352525200577 - 227 = 21352390982849 is a prime.
It is a super-2 number, since 2×213525252005772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21352525200077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10676262600288 + 10676262600289.
It is an arithmetic number, because the mean of its divisors is an integer number (10676262600289).
Almost surely, 221352525200577 is an apocalyptic number.
It is an amenable number.
21352525200577 is a deficient number, since it is larger than the sum of its proper divisors (1).
21352525200577 is an equidigital number, since it uses as much as digits as its factorization.
21352525200577 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1470000, while the sum is 46.
Adding to 21352525200577 its reverse (77500252525312), we get a palindrome (98852777725889).
The spelling of 21352525200577 in words is "twenty-one trillion, three hundred fifty-two billion, five hundred twenty-five million, two hundred thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •