Base | Representation |
---|---|
bin | 111101011110010011001… |
… | …100001100111010010011 |
3 | 112221211222020211211122111 |
4 | 331132103030030322103 |
5 | 1023203104102120311 |
6 | 12552401154450151 |
7 | 614130060044611 |
oct | 75362314147223 |
9 | 15854866754574 |
10 | 4224422301331 |
11 | 1389627293281 |
12 | 58287a593957 |
13 | 248490a6328b |
14 | 10866ab886b1 |
15 | 74d4853bd21 |
hex | 3d79330ce93 |
4224422301331 has 2 divisors, whose sum is σ = 4224422301332. Its totient is φ = 4224422301330.
The previous prime is 4224422301269. The next prime is 4224422301349. The reversal of 4224422301331 is 1331032244224.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4224422301331 - 213 = 4224422293139 is a prime.
It is a super-2 number, since 2×42244223013312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4224422301293 and 4224422301302.
It is not a weakly prime, because it can be changed into another prime (4224422301391) 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, 2112211150665 + 2112211150666.
It is an arithmetic number, because the mean of its divisors is an integer number (2112211150666).
Almost surely, 24224422301331 is an apocalyptic number.
4224422301331 is a deficient number, since it is larger than the sum of its proper divisors (1).
4224422301331 is an equidigital number, since it uses as much as digits as its factorization.
4224422301331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 4224422301331 its reverse (1331032244224), we get a palindrome (5555454545555).
The spelling of 4224422301331 in words is "four trillion, two hundred twenty-four billion, four hundred twenty-two million, three hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •