Base | Representation |
---|---|
bin | 100100011001000… |
… | …1010110100001101 |
3 | 10011002201212110022 |
4 | 1020302022310031 |
5 | 10000101023203 |
6 | 321100351525 |
7 | 42155162351 |
oct | 11062126415 |
9 | 3132655408 |
10 | 1221111053 |
11 | 577315898 |
12 | 2a0b455a5 |
13 | 165ca6526 |
14 | b8267461 |
15 | 7230aa38 |
hex | 48c8ad0d |
1221111053 has 2 divisors, whose sum is σ = 1221111054. Its totient is φ = 1221111052.
The previous prime is 1221111029. The next prime is 1221111083. The reversal of 1221111053 is 3501111221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1058981764 + 162129289 = 32542^2 + 12733^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221111053 - 28 = 1221110797 is a prime.
It is a super-2 number, since 2×12211110532 = 2982224407517537618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221111083) 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, 610555526 + 610555527.
It is an arithmetic number, because the mean of its divisors is an integer number (610555527).
Almost surely, 21221111053 is an apocalyptic number.
It is an amenable number.
1221111053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221111053 is an equidigital number, since it uses as much as digits as its factorization.
1221111053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 1221111053 is about 34944.3994511281. The cubic root of 1221111053 is about 1068.8540014474.
Adding to 1221111053 its reverse (3501111221), we get a palindrome (4722222274).
The spelling of 1221111053 in words is "one billion, two hundred twenty-one million, one hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •