Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001001101110010100001001 |
3 | 111020222011121111020010001111 |
4 | 112333031233021232110021 |
5 | 101222420023100004041 |
6 | 555005112033050321 |
7 | 30203212335544345 |
oct | 2677155711562411 |
9 | 436864544203044 |
10 | 101101100000521 |
11 | 2a239810282905 |
12 | b40a0a19b69a1 |
13 | 4454a3caa21aa |
14 | 1ad7468418625 |
15 | ba4d11b06981 |
hex | 5bf36f26e509 |
101101100000521 has 2 divisors, whose sum is σ = 101101100000522. Its totient is φ = 101101100000520.
The previous prime is 101101100000519. The next prime is 101101100000557. The reversal of 101101100000521 is 125000001101101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54620066710521 + 46481033290000 = 7390539^2 + 6817700^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101100000521 - 21 = 101101100000519 is a prime.
Together with 101101100000519, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101101100000501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550550000260 + 50550550000261.
It is an arithmetic number, because the mean of its divisors is an integer number (50550550000261).
Almost surely, 2101101100000521 is an apocalyptic number.
It is an amenable number.
101101100000521 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101100000521 is an equidigital number, since it uses as much as digits as its factorization.
101101100000521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 101101100000521 its reverse (125000001101101), we get a palindrome (226101101101622).
The spelling of 101101100000521 in words is "one hundred one trillion, one hundred one billion, one hundred million, five hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •