Base | Representation |
---|---|
bin | 11111011111001… |
… | …00111001001001 |
3 | 200102000012102002 |
4 | 33233210321021 |
5 | 1020104130441 |
6 | 42113120345 |
7 | 6355032443 |
oct | 1757447111 |
9 | 612005362 |
10 | 264130121 |
11 | 126104962 |
12 | 745590b5 |
13 | 4294c118 |
14 | 27117493 |
15 | 182c5b9b |
hex | fbe4e49 |
264130121 has 2 divisors, whose sum is σ = 264130122. Its totient is φ = 264130120.
The previous prime is 264130103. The next prime is 264130129. The reversal of 264130121 is 121031462.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 220106896 + 44023225 = 14836^2 + 6635^2 .
It is a cyclic number.
It is not a de Polignac number, because 264130121 - 210 = 264129097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 264130093 and 264130102.
It is not a weakly prime, because it can be changed into another prime (264130129) 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, 132065060 + 132065061.
It is an arithmetic number, because the mean of its divisors is an integer number (132065061).
Almost surely, 2264130121 is an apocalyptic number.
It is an amenable number.
264130121 is a deficient number, since it is larger than the sum of its proper divisors (1).
264130121 is an equidigital number, since it uses as much as digits as its factorization.
264130121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 264130121 is about 16252.0805129682. The cubic root of 264130121 is about 641.6122445401.
Adding to 264130121 its reverse (121031462), we get a palindrome (385161583).
The spelling of 264130121 in words is "two hundred sixty-four million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •