Base | Representation |
---|---|
bin | 100100011001000… |
… | …1001011110000101 |
3 | 10011002201120220011 |
4 | 1020302021132011 |
5 | 10000100334131 |
6 | 321100310221 |
7 | 42155140315 |
oct | 11062113605 |
9 | 3132646804 |
10 | 1221105541 |
11 | 577311737 |
12 | 2a0b42371 |
13 | 165ca3b76 |
14 | b8265445 |
15 | 723090b1 |
hex | 48c89785 |
1221105541 has 2 divisors, whose sum is σ = 1221105542. Its totient is φ = 1221105540.
The previous prime is 1221105539. The next prime is 1221105569. The reversal of 1221105541 is 1455011221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017929025 + 203176516 = 31905^2 + 14254^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221105541 - 21 = 1221105539 is a prime.
Together with 1221105539, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221108541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610552770 + 610552771.
It is an arithmetic number, because the mean of its divisors is an integer number (610552771).
Almost surely, 21221105541 is an apocalyptic number.
It is an amenable number.
1221105541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221105541 is an equidigital number, since it uses as much as digits as its factorization.
1221105541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 1221105541 is about 34944.3205828930. The cubic root of 1221105541 is about 1068.8523932038.
Adding to 1221105541 its reverse (1455011221), we get a palindrome (2676116762).
The spelling of 1221105541 in words is "one billion, two hundred twenty-one million, one hundred five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •