Base | Representation |
---|---|
bin | 111101011100000111010… |
… | …000101001000101011101 |
3 | 112221121220122100001101221 |
4 | 331130013100221011131 |
5 | 1023133302102430234 |
6 | 12551332212333341 |
7 | 614014642301065 |
oct | 75340720510535 |
9 | 15847818301357 |
10 | 4222074655069 |
11 | 1388632089957 |
12 | 582324314251 |
13 | 2481a857818b |
14 | 1084c70763a5 |
15 | 74c5c3a7eb4 |
hex | 3d70742915d |
4222074655069 has 2 divisors, whose sum is σ = 4222074655070. Its totient is φ = 4222074655068.
The previous prime is 4222074655039. The next prime is 4222074655091. The reversal of 4222074655069 is 9605564702224.
4222074655069 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., 3175060696900 + 1047013958169 = 1781870^2 + 1023237^2 .
It is a cyclic number.
It is not a de Polignac number, because 4222074655069 - 213 = 4222074646877 is a prime.
It is a super-2 number, since 2×42220746550692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4222074655039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2111037327534 + 2111037327535.
It is an arithmetic number, because the mean of its divisors is an integer number (2111037327535).
Almost surely, 24222074655069 is an apocalyptic number.
It is an amenable number.
4222074655069 is a deficient number, since it is larger than the sum of its proper divisors (1).
4222074655069 is an equidigital number, since it uses as much as digits as its factorization.
4222074655069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 52.
The spelling of 4222074655069 in words is "four trillion, two hundred twenty-two billion, seventy-four million, six hundred fifty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •