Base | Representation |
---|---|
bin | 101010111110110… |
… | …1000110100001001 |
3 | 10201111210102201111 |
4 | 1111331220310021 |
5 | 10423202040241 |
6 | 355035450321 |
7 | 50511451612 |
oct | 12575506411 |
9 | 3644712644 |
10 | 1442221321 |
11 | 680107252 |
12 | 342bb69a1 |
13 | 19ca423c8 |
14 | d9782c09 |
15 | 86934c81 |
hex | 55f68d09 |
1442221321 has 2 divisors, whose sum is σ = 1442221322. Its totient is φ = 1442221320.
The previous prime is 1442221241. The next prime is 1442221343. The reversal of 1442221321 is 1231222441.
It is an a-pointer prime, because the next prime (1442221343) can be obtained adding 1442221321 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1119839296 + 322382025 = 33464^2 + 17955^2 .
It is a cyclic number.
It is not a de Polignac number, because 1442221321 - 29 = 1442220809 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1442221292 and 1442221301.
It is not a weakly prime, because it can be changed into another prime (1442221421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 721110660 + 721110661.
It is an arithmetic number, because the mean of its divisors is an integer number (721110661).
Almost surely, 21442221321 is an apocalyptic number.
It is an amenable number.
1442221321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1442221321 is an equidigital number, since it uses as much as digits as its factorization.
1442221321 is an evil number, because the sum of its binary digits is even.
The product of its digits is 768, while the sum is 22.
The square root of 1442221321 is about 37976.5891175076. The cubic root of 1442221321 is about 1129.8235872043.
Adding to 1442221321 its reverse (1231222441), we get a palindrome (2673443762).
The spelling of 1442221321 in words is "one billion, four hundred forty-two million, two hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •