Base | Representation |
---|---|
bin | 10001110010011000101… |
… | …110011110101011000101 |
3 | 11022212001111020202001122 |
4 | 101302120232132223011 |
5 | 130011314224030112 |
6 | 2333310531003325 |
7 | 154211360231615 |
oct | 21623056365305 |
9 | 4285044222048 |
10 | 1222333033157 |
11 | 431430149495 |
12 | 178a90a39545 |
13 | 8b35b432222 |
14 | 432385daa45 |
15 | 21be06a0872 |
hex | 11c98b9eac5 |
1222333033157 has 2 divisors, whose sum is σ = 1222333033158. Its totient is φ = 1222333033156.
The previous prime is 1222333033153. The next prime is 1222333033219. The reversal of 1222333033157 is 7513303332221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1103069173441 + 119263859716 = 1050271^2 + 345346^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222333033157 - 22 = 1222333033153 is a prime.
It is a super-2 number, since 2×12223330331572 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1222333033153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611166516578 + 611166516579.
It is an arithmetic number, because the mean of its divisors is an integer number (611166516579).
Almost surely, 21222333033157 is an apocalyptic number.
It is an amenable number.
1222333033157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222333033157 is an equidigital number, since it uses as much as digits as its factorization.
1222333033157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 35.
Adding to 1222333033157 its reverse (7513303332221), we get a palindrome (8735636365378).
The spelling of 1222333033157 in words is "one trillion, two hundred twenty-two billion, three hundred thirty-three million, thirty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •