Base | Representation |
---|---|
bin | 10001110011000000100… |
… | …010111111111010010101 |
3 | 11022220210001100200020101 |
4 | 101303000202333322111 |
5 | 130014201241042323 |
6 | 2333501114134101 |
7 | 154234051634146 |
oct | 21630042777225 |
9 | 4286701320211 |
10 | 1223001112213 |
11 | 431743276141 |
12 | 179038721331 |
13 | 8b43697618a |
14 | 4329d225acd |
15 | 21c2e169dad |
hex | 11cc08bfe95 |
1223001112213 has 2 divisors, whose sum is σ = 1223001112214. Its totient is φ = 1223001112212.
The previous prime is 1223001112183. The next prime is 1223001112231. The reversal of 1223001112213 is 3122111003221.
Together with next prime (1223001112231) 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., 1218447291889 + 4553820324 = 1103833^2 + 67482^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1223001112213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1223001112313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611500556106 + 611500556107.
It is an arithmetic number, because the mean of its divisors is an integer number (611500556107).
Almost surely, 21223001112213 is an apocalyptic number.
It is an amenable number.
1223001112213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223001112213 is an equidigital number, since it uses as much as digits as its factorization.
1223001112213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1223001112213 its reverse (3122111003221), we get a palindrome (4345112115434).
The spelling of 1223001112213 in words is "one trillion, two hundred twenty-three billion, one million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •