Base | Representation |
---|---|
bin | 10100101100100011011… |
… | …010000011111101111101 |
3 | 12000222000112021211120121 |
4 | 110230203122003331331 |
5 | 141300210410201113 |
6 | 3005210154214541 |
7 | 204516066213445 |
oct | 24544332037575 |
9 | 5028015254517 |
10 | 1422228209533 |
11 | 4a918882409a |
12 | 1ab779424451 |
13 | a4166b0c191 |
14 | 4cb9c7d3125 |
15 | 26ede81ae8d |
hex | 14b23683f7d |
1422228209533 has 2 divisors, whose sum is σ = 1422228209534. Its totient is φ = 1422228209532.
The previous prime is 1422228209471. The next prime is 1422228209573. The reversal of 1422228209533 is 3359028222241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1378318264324 + 43909945209 = 1174018^2 + 209547^2 .
It is a cyclic number.
It is not a de Polignac number, because 1422228209533 - 29 = 1422228209021 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1422228209533.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1422228209573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711114104766 + 711114104767.
It is an arithmetic number, because the mean of its divisors is an integer number (711114104767).
Almost surely, 21422228209533 is an apocalyptic number.
It is an amenable number.
1422228209533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1422228209533 is an equidigital number, since it uses as much as digits as its factorization.
1422228209533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 43.
The spelling of 1422228209533 in words is "one trillion, four hundred twenty-two billion, two hundred twenty-eight million, two hundred nine thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •