Base | Representation |
---|---|
bin | 111100000110100100110011… |
… | …011111000011100001100001 |
3 | 1021122221010212120120221000101 |
4 | 330012210303133003201201 |
5 | 234121324303224324413 |
6 | 2334105352322422401 |
7 | 106451355310530061 |
oct | 7406446337034141 |
9 | 1248833776527011 |
10 | 264334626011233 |
11 | 7725275a215028 |
12 | 257919a3501a01 |
13 | b46585735332b |
14 | 493bc153953a1 |
15 | 2085e3c0b4edd |
hex | f069337c3861 |
264334626011233 has 2 divisors, whose sum is σ = 264334626011234. Its totient is φ = 264334626011232.
The previous prime is 264334626011147. The next prime is 264334626011237. The reversal of 264334626011233 is 332110626433462.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 239771381609809 + 24563244401424 = 15484553^2 + 4956132^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-264334626011233 is a prime.
It is not a weakly prime, because it can be changed into another prime (264334626011237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132167313005616 + 132167313005617.
It is an arithmetic number, because the mean of its divisors is an integer number (132167313005617).
Almost surely, 2264334626011233 is an apocalyptic number.
It is an amenable number.
264334626011233 is a deficient number, since it is larger than the sum of its proper divisors (1).
264334626011233 is an equidigital number, since it uses as much as digits as its factorization.
264334626011233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2239488, while the sum is 46.
The spelling of 264334626011233 in words is "two hundred sixty-four trillion, three hundred thirty-four billion, six hundred twenty-six million, eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •