Base | Representation |
---|---|
bin | 1001100111100111101000… |
… | …11100001111101101010001 |
3 | 2202220011100111012020122102 |
4 | 10303303310130033231101 |
5 | 10233030330110314302 |
6 | 112553200013450145 |
7 | 4312135110332534 |
oct | 463636434175521 |
9 | 82804314166572 |
10 | 21152520010577 |
11 | 681580811234a |
12 | 24576001a0955 |
13 | ba589bc46337 |
14 | 531b049d4a1b |
15 | 26a35b55b702 |
hex | 133cf470fb51 |
21152520010577 has 2 divisors, whose sum is σ = 21152520010578. Its totient is φ = 21152520010576.
The previous prime is 21152520010561. The next prime is 21152520010597. The reversal of 21152520010577 is 77501002525112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18075498837841 + 3077021172736 = 4251529^2 + 1754144^2 .
It is a cyclic number.
It is not a de Polignac number, because 21152520010577 - 24 = 21152520010561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21152520010577.
It is not a weakly prime, because it can be changed into another prime (21152520010597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10576260005288 + 10576260005289.
It is an arithmetic number, because the mean of its divisors is an integer number (10576260005289).
Almost surely, 221152520010577 is an apocalyptic number.
It is an amenable number.
21152520010577 is a deficient number, since it is larger than the sum of its proper divisors (1).
21152520010577 is an equidigital number, since it uses as much as digits as its factorization.
21152520010577 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49000, while the sum is 38.
Adding to 21152520010577 its reverse (77501002525112), we get a palindrome (98653522535689).
The spelling of 21152520010577 in words is "twenty-one trillion, one hundred fifty-two billion, five hundred twenty million, ten thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •