Base | Representation |
---|---|
bin | 1101000100000111101… |
… | …0110000101001011111 |
3 | 210110022220101211021201 |
4 | 3101001322300221133 |
5 | 12134130210101142 |
6 | 251035214340331 |
7 | 22133636260333 |
oct | 3210172605137 |
9 | 713286354251 |
10 | 224444222047 |
11 | 87205a04001 |
12 | 375b9aba6a7 |
13 | 1821b6712a6 |
14 | ac127137c3 |
15 | 5c89461ab7 |
hex | 3441eb0a5f |
224444222047 has 2 divisors, whose sum is σ = 224444222048. Its totient is φ = 224444222046.
The previous prime is 224444221993. The next prime is 224444222069. The reversal of 224444222047 is 740222444422.
224444222047 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 is a cyclic number.
It is not a de Polignac number, because 224444222047 - 223 = 224435833439 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 224444221997 and 224444222015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (224444222087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 112222111023 + 112222111024.
It is an arithmetic number, because the mean of its divisors is an integer number (112222111024).
Almost surely, 2224444222047 is an apocalyptic number.
224444222047 is a deficient number, since it is larger than the sum of its proper divisors (1).
224444222047 is an equidigital number, since it uses as much as digits as its factorization.
224444222047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 229376, while the sum is 37.
Adding to 224444222047 its reverse (740222444422), we get a palindrome (964666666469).
The spelling of 224444222047 in words is "two hundred twenty-four billion, four hundred forty-four million, two hundred twenty-two thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •