Base | Representation |
---|---|
bin | 100100011001000… |
… | …1111111101010001 |
3 | 10011002202221100022 |
4 | 1020302033331101 |
5 | 10000102211423 |
6 | 321101033225 |
7 | 42155310635 |
oct | 11062177521 |
9 | 3132687308 |
10 | 1221132113 |
11 | 57732a6a3 |
12 | 2a0b55815 |
13 | 165cb2ca6 |
14 | b8270dc5 |
15 | 72311dc8 |
hex | 48c8ff51 |
1221132113 has 2 divisors, whose sum is σ = 1221132114. Its totient is φ = 1221132112.
The previous prime is 1221132041. The next prime is 1221132131. The reversal of 1221132113 is 3112311221.
Together with next prime (1221132131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 685811344 + 535320769 = 26188^2 + 23137^2 .
It is a cyclic number.
It is not a de Polignac number, because 1221132113 - 212 = 1221128017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1221132091 and 1221132100.
It is not a weakly prime, because it can be changed into another prime (1221132173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610566056 + 610566057.
It is an arithmetic number, because the mean of its divisors is an integer number (610566057).
Almost surely, 21221132113 is an apocalyptic number.
It is an amenable number.
1221132113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221132113 is an equidigital number, since it uses as much as digits as its factorization.
1221132113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 72, while the sum is 17.
The square root of 1221132113 is about 34944.7007856699. The cubic root of 1221132113 is about 1068.8601461072.
Adding to 1221132113 its reverse (3112311221), we get a palindrome (4333443334).
The spelling of 1221132113 in words is "one billion, two hundred twenty-one million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •