Base | Representation |
---|---|
bin | 10000010101001001100… |
… | …101110011001111010101 |
3 | 10222021122112000010102022 |
4 | 100111021211303033111 |
5 | 121341302101011404 |
6 | 2215312525022525 |
7 | 144035454022322 |
oct | 20251145631725 |
9 | 3867575003368 |
10 | 1122221110229 |
11 | 3a2a27618aaa |
12 | 1615b16b4a45 |
13 | 81a956960cb |
14 | 3c45c763b49 |
15 | 1e2d17088be |
hex | 105499733d5 |
1122221110229 has 2 divisors, whose sum is σ = 1122221110230. Its totient is φ = 1122221110228.
The previous prime is 1122221110217. The next prime is 1122221110243. The reversal of 1122221110229 is 9220111222211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 705516002500 + 416705107729 = 839950^2 + 645527^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1122221110229 is a prime.
It is a super-3 number, since 3×11222211102293 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122221110198 and 1122221110207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122221115229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561110555114 + 561110555115.
It is an arithmetic number, because the mean of its divisors is an integer number (561110555115).
Almost surely, 21122221110229 is an apocalyptic number.
It is an amenable number.
1122221110229 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122221110229 is an equidigital number, since it uses as much as digits as its factorization.
1122221110229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 1122221110229 in words is "one trillion, one hundred twenty-two billion, two hundred twenty-one million, one hundred ten thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •