Base | Representation |
---|---|
bin | 10011100110001101… |
… | …10110110111111101 |
3 | 1000011020022212111002 |
4 | 21303012312313331 |
5 | 133021401041221 |
6 | 4455555540045 |
7 | 521502656045 |
oct | 116306666775 |
9 | 30136285432 |
10 | 10521112061 |
11 | 4509991239 |
12 | 20575ba625 |
13 | cb8954bc5 |
14 | 71b452725 |
15 | 4189e680b |
hex | 2731b6dfd |
10521112061 has 2 divisors, whose sum is σ = 10521112062. Its totient is φ = 10521112060.
The previous prime is 10521112013. The next prime is 10521112073. The reversal of 10521112061 is 16021112501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9921156025 + 599956036 = 99605^2 + 24494^2 .
It is an emirp because it is prime and its reverse (16021112501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10521112061 is a prime.
It is a super-2 number, since 2×105211120612 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10521115061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5260556030 + 5260556031.
It is an arithmetic number, because the mean of its divisors is an integer number (5260556031).
Almost surely, 210521112061 is an apocalyptic number.
It is an amenable number.
10521112061 is a deficient number, since it is larger than the sum of its proper divisors (1).
10521112061 is an equidigital number, since it uses as much as digits as its factorization.
10521112061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 10521112061 its reverse (16021112501), we get a palindrome (26542224562).
The spelling of 10521112061 in words is "ten billion, five hundred twenty-one million, one hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •