Base | Representation |
---|---|
bin | 101010011000010… |
… | …1010110001001001 |
3 | 10200002211022221221 |
4 | 1110300222301021 |
5 | 10403020403413 |
6 | 353035202041 |
7 | 50145114361 |
oct | 12460526111 |
9 | 3602738857 |
10 | 1422044233 |
11 | 66a785975 |
12 | 3382a6321 |
13 | 1987c94bc |
14 | d6c0d9a1 |
15 | 84c9b68d |
hex | 54c2ac49 |
1422044233 has 2 divisors, whose sum is σ = 1422044234. Its totient is φ = 1422044232.
The previous prime is 1422044213. The next prime is 1422044279. The reversal of 1422044233 is 3324402241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 820421449 + 601622784 = 28643^2 + 24528^2 .
It is a cyclic number.
It is not a de Polignac number, because 1422044233 - 213 = 1422036041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1422044198 and 1422044207.
It is not a weakly prime, because it can be changed into another prime (1422044213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711022116 + 711022117.
It is an arithmetic number, because the mean of its divisors is an integer number (711022117).
Almost surely, 21422044233 is an apocalyptic number.
It is an amenable number.
1422044233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1422044233 is an equidigital number, since it uses as much as digits as its factorization.
1422044233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 25.
The square root of 1422044233 is about 37710.0017634579. The cubic root of 1422044233 is about 1124.5299720105.
Adding to 1422044233 its reverse (3324402241), we get a palindrome (4746446474).
The spelling of 1422044233 in words is "one billion, four hundred twenty-two million, forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •