Base | Representation |
---|---|
bin | 100000110100011… |
… | …1101010101111101 |
3 | 2211202012121022112 |
4 | 1001220331111331 |
5 | 4223410143221 |
6 | 301135423405 |
7 | 36201344033 |
oct | 10150752575 |
9 | 2752177275 |
10 | 1101256061 |
11 | 5156a2a84 |
12 | 268984b65 |
13 | 147200609 |
14 | a6388553 |
15 | 66a3315b |
hex | 41a3d57d |
1101256061 has 2 divisors, whose sum is σ = 1101256062. Its totient is φ = 1101256060.
The previous prime is 1101256043. The next prime is 1101256067. The reversal of 1101256061 is 1606521011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1080371161 + 20884900 = 32869^2 + 4570^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101256061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101256067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550628030 + 550628031.
It is an arithmetic number, because the mean of its divisors is an integer number (550628031).
Almost surely, 21101256061 is an apocalyptic number.
It is an amenable number.
1101256061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101256061 is an equidigital number, since it uses as much as digits as its factorization.
1101256061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 23.
The square root of 1101256061 is about 33185.1783331053. The cubic root of 1101256061 is about 1032.6728771493.
Adding to 1101256061 its reverse (1606521011), we get a palindrome (2707777072).
The spelling of 1101256061 in words is "one billion, one hundred one million, two hundred fifty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •