Base | Representation |
---|---|
bin | 110001100100100… |
… | …0001100110001101 |
3 | 11021220210220200021 |
4 | 1203021001212031 |
5 | 11401301411341 |
6 | 433014302141 |
7 | 56134621636 |
oct | 14311014615 |
9 | 4256726607 |
10 | 1663310221 |
11 | 783993651 |
12 | 3a5057951 |
13 | 2067a1641 |
14 | 11ac9488d |
15 | 9b0579d1 |
hex | 6324198d |
1663310221 has 2 divisors, whose sum is σ = 1663310222. Its totient is φ = 1663310220.
The previous prime is 1663310197. The next prime is 1663310261. The reversal of 1663310221 is 1220133661.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1442936196 + 220374025 = 37986^2 + 14845^2 .
It is an emirp because it is prime and its reverse (1220133661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1663310221 - 213 = 1663302029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1663310261) 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, 831655110 + 831655111.
It is an arithmetic number, because the mean of its divisors is an integer number (831655111).
Almost surely, 21663310221 is an apocalyptic number.
It is an amenable number.
1663310221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1663310221 is an equidigital number, since it uses as much as digits as its factorization.
1663310221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 1663310221 is about 40783.7004328935. The cubic root of 1663310221 is about 1184.8346653437.
Adding to 1663310221 its reverse (1220133661), we get a palindrome (2883443882).
The spelling of 1663310221 in words is "one billion, six hundred sixty-three million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •