Base | Representation |
---|---|
bin | 1100111011001001001… |
… | …0000100100111111001 |
3 | 210020002221220220012112 |
4 | 3032302102010213321 |
5 | 12114211302222243 |
6 | 250000132022105 |
7 | 22020135244163 |
oct | 3166222044771 |
9 | 706087826175 |
10 | 222034414073 |
11 | 8618970266a |
12 | 37046a61935 |
13 | 17c26330304 |
14 | aa6465d933 |
15 | 5b97aee818 |
hex | 33b24849f9 |
222034414073 has 2 divisors, whose sum is σ = 222034414074. Its totient is φ = 222034414072.
The previous prime is 222034414061. The next prime is 222034414081. The reversal of 222034414073 is 370414430222.
222034414073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219935674729 + 2098739344 = 468973^2 + 45812^2 .
It is a cyclic number.
It is not a de Polignac number, because 222034414073 - 218 = 222034151929 is a prime.
It is not a weakly prime, because it can be changed into another prime (222034416073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111017207036 + 111017207037.
It is an arithmetic number, because the mean of its divisors is an integer number (111017207037).
Almost surely, 2222034414073 is an apocalyptic number.
It is an amenable number.
222034414073 is a deficient number, since it is larger than the sum of its proper divisors (1).
222034414073 is an equidigital number, since it uses as much as digits as its factorization.
222034414073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 32.
Adding to 222034414073 its reverse (370414430222), we get a palindrome (592448844295).
The spelling of 222034414073 in words is "two hundred twenty-two billion, thirty-four million, four hundred fourteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •