Base | Representation |
---|---|
bin | 101011100010110… |
… | …0001100111101101 |
3 | 10202211020212001202 |
4 | 1113011201213231 |
5 | 10443013104341 |
6 | 400551415245 |
7 | 51130600166 |
oct | 12705414755 |
9 | 3684225052 |
10 | 1461066221 |
11 | 68a80874a |
12 | 349384525 |
13 | 1a390cb34 |
14 | dc08a76d |
15 | 8840879b |
hex | 571619ed |
1461066221 has 2 divisors, whose sum is σ = 1461066222. Its totient is φ = 1461066220.
The previous prime is 1461066121. The next prime is 1461066247. The reversal of 1461066221 is 1226601641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1458858025 + 2208196 = 38195^2 + 1486^2 .
It is an emirp because it is prime and its reverse (1226601641) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1461066221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1461066281) 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, 730533110 + 730533111.
It is an arithmetic number, because the mean of its divisors is an integer number (730533111).
Almost surely, 21461066221 is an apocalyptic number.
It is an amenable number.
1461066221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1461066221 is an equidigital number, since it uses as much as digits as its factorization.
1461066221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 1461066221 is about 38223.8959421983. The cubic root of 1461066221 is about 1134.7232846994.
Adding to 1461066221 its reverse (1226601641), we get a palindrome (2687667862).
The spelling of 1461066221 in words is "one billion, four hundred sixty-one million, sixty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •