Base | Representation |
---|---|
bin | 1010001100010101111110… |
… | …00001101000110011001111 |
3 | 2221100210100012002000022002 |
4 | 11012022333001220303033 |
5 | 10414214034110244142 |
6 | 115401001345542515 |
7 | 4502245226243552 |
oct | 506127701506317 |
9 | 87323305060262 |
10 | 22414344228047 |
11 | 7161962a81042 |
12 | 2620072644a3b |
13 | c67881baa235 |
14 | 576c07d90699 |
15 | 28d0adbd8a32 |
hex | 1462bf068ccf |
22414344228047 has 2 divisors, whose sum is σ = 22414344228048. Its totient is φ = 22414344228046.
The previous prime is 22414344228043. The next prime is 22414344228097. The reversal of 22414344228047 is 74082244341422.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22414344228047 - 22 = 22414344228043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22414344227992 and 22414344228010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22414344228043) 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, 11207172114023 + 11207172114024.
It is an arithmetic number, because the mean of its divisors is an integer number (11207172114024).
Almost surely, 222414344228047 is an apocalyptic number.
22414344228047 is a deficient number, since it is larger than the sum of its proper divisors (1).
22414344228047 is an equidigital number, since it uses as much as digits as its factorization.
22414344228047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2752512, while the sum is 47.
Adding to 22414344228047 its reverse (74082244341422), we get a palindrome (96496588569469).
The spelling of 22414344228047 in words is "twenty-two trillion, four hundred fourteen billion, three hundred forty-four million, two hundred twenty-eight thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •