Base | Representation |
---|---|
bin | 1111111001001101… |
… | …1101001101000101 |
3 | 102000100012022212012 |
4 | 3332103131031011 |
5 | 32214211410341 |
6 | 1543210104005 |
7 | 210504523025 |
oct | 37623351505 |
9 | 12010168765 |
10 | 4266513221 |
11 | 189a376593 |
12 | 9b0a1b005 |
13 | 52cbc6449 |
14 | 2c68cba85 |
15 | 19e86c0eb |
hex | fe4dd345 |
4266513221 has 2 divisors, whose sum is σ = 4266513222. Its totient is φ = 4266513220.
The previous prime is 4266513217. The next prime is 4266513227. The reversal of 4266513221 is 1223156624.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2697244225 + 1569268996 = 51935^2 + 39614^2 .
It is a cyclic number.
It is not a de Polignac number, because 4266513221 - 22 = 4266513217 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4266513227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2133256610 + 2133256611.
It is an arithmetic number, because the mean of its divisors is an integer number (2133256611).
Almost surely, 24266513221 is an apocalyptic number.
It is an amenable number.
4266513221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4266513221 is an equidigital number, since it uses as much as digits as its factorization.
4266513221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17280, while the sum is 32.
The square root of 4266513221 is about 65318.5518899493. The cubic root of 4266513221 is about 1621.9010884294.
Adding to 4266513221 its reverse (1223156624), we get a palindrome (5489669845).
The spelling of 4266513221 in words is "four billion, two hundred sixty-six million, five hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •