Base | Representation |
---|---|
bin | 111101011110010011001… |
… | …100001100111001010101 |
3 | 112221211222020211211120012 |
4 | 331132103030030321111 |
5 | 1023203104102120034 |
6 | 12552401154450005 |
7 | 614130060044462 |
oct | 75362314147125 |
9 | 15854866754505 |
10 | 4224422301269 |
11 | 1389627293225 |
12 | 58287a593905 |
13 | 248490a63241 |
14 | 10866ab88669 |
15 | 74d4853bcce |
hex | 3d79330ce55 |
4224422301269 has 2 divisors, whose sum is σ = 4224422301270. Its totient is φ = 4224422301268.
The previous prime is 4224422301259. The next prime is 4224422301331. The reversal of 4224422301269 is 9621032244224.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3429403978225 + 795018323044 = 1851865^2 + 891638^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4224422301269 is a prime.
It is a super-2 number, since 2×42244223012692 (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 (4224422301259) 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, 2112211150634 + 2112211150635.
It is an arithmetic number, because the mean of its divisors is an integer number (2112211150635).
Almost surely, 24224422301269 is an apocalyptic number.
It is an amenable number.
4224422301269 is a deficient number, since it is larger than the sum of its proper divisors (1).
4224422301269 is an equidigital number, since it uses as much as digits as its factorization.
4224422301269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 41.
The spelling of 4224422301269 in words is "four trillion, two hundred twenty-four billion, four hundred twenty-two million, three hundred one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •