Base | Representation |
---|---|
bin | 111101011110010111111… |
… | …101011011111001111101 |
3 | 112221212011211102001001112 |
4 | 331132113331123321331 |
5 | 1023203240043113134 |
6 | 12552413133451405 |
7 | 614132051133515 |
oct | 75362775337175 |
9 | 15855154361045 |
10 | 4224502316669 |
11 | 1389668474a58 |
12 | 5828a1340b65 |
13 | 2484a44ca62b |
14 | 108677656845 |
15 | 74d505951ce |
hex | 3d797f5be7d |
4224502316669 has 2 divisors, whose sum is σ = 4224502316670. Its totient is φ = 4224502316668.
The previous prime is 4224502316623. The next prime is 4224502316707. The reversal of 4224502316669 is 9666132054224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2722929016900 + 1501573299769 = 1650130^2 + 1225387^2 .
It is a cyclic number.
It is not a de Polignac number, because 4224502316669 - 216 = 4224502251133 is a prime.
It is a super-2 number, since 2×42245023166692 (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 (4224502318669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2112251158334 + 2112251158335.
It is an arithmetic number, because the mean of its divisors is an integer number (2112251158335).
Almost surely, 24224502316669 is an apocalyptic number.
It is an amenable number.
4224502316669 is a deficient number, since it is larger than the sum of its proper divisors (1).
4224502316669 is an equidigital number, since it uses as much as digits as its factorization.
4224502316669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 4224502316669 in words is "four trillion, two hundred twenty-four billion, five hundred two million, three hundred sixteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •