Base | Representation |
---|---|
bin | 101010111110110… |
… | …1000110001110001 |
3 | 10201111210102111212 |
4 | 1111331220301301 |
5 | 10423202034134 |
6 | 355035445505 |
7 | 50511451304 |
oct | 12575506161 |
9 | 3644712455 |
10 | 1442221169 |
11 | 680107124 |
12 | 342bb6895 |
13 | 19ca4230c |
14 | d9782b3b |
15 | 86934bce |
hex | 55f68c71 |
1442221169 has 2 divisors, whose sum is σ = 1442221170. Its totient is φ = 1442221168.
The previous prime is 1442221103. The next prime is 1442221177. The reversal of 1442221169 is 9611222441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1436031025 + 6190144 = 37895^2 + 2488^2 .
It is an emirp because it is prime and its reverse (9611222441) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1442221169 is a prime.
It is a super-2 number, since 2×14422211692 = 4160003800623453122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1442226169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 721110584 + 721110585.
It is an arithmetic number, because the mean of its divisors is an integer number (721110585).
Almost surely, 21442221169 is an apocalyptic number.
It is an amenable number.
1442221169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1442221169 is an equidigital number, since it uses as much as digits as its factorization.
1442221169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 32.
The square root of 1442221169 is about 37976.5871162747. The cubic root of 1442221169 is about 1129.8235475125.
The spelling of 1442221169 in words is "one billion, four hundred forty-two million, two hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •