Base | Representation |
---|---|
bin | 111100001011001010101111… |
… | …001110000100010111100001 |
3 | 1021201001022111212201122201011 |
4 | 330023022233032010113201 |
5 | 234142012140020430013 |
6 | 2334510350032540521 |
7 | 106513230345024556 |
oct | 7413125716042741 |
9 | 1251038455648634 |
10 | 264650234545633 |
11 | 77364596a90232 |
12 | 25822ba40b1741 |
13 | b489543ac42c1 |
14 | 494d1d5486a2d |
15 | 208e25ebdec3d |
hex | f0b2af3845e1 |
264650234545633 has 2 divisors, whose sum is σ = 264650234545634. Its totient is φ = 264650234545632.
The previous prime is 264650234545607. The next prime is 264650234545889. The reversal of 264650234545633 is 336545432056462.
264650234545633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 254114939006289 + 10535295539344 = 15940983^2 + 3245812^2 .
It is a cyclic number.
It is not a de Polignac number, because 264650234545633 - 213 = 264650234537441 is a prime.
It is not a weakly prime, because it can be changed into another prime (264650234545033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132325117272816 + 132325117272817.
It is an arithmetic number, because the mean of its divisors is an integer number (132325117272817).
Almost surely, 2264650234545633 is an apocalyptic number.
It is an amenable number.
264650234545633 is a deficient number, since it is larger than the sum of its proper divisors (1).
264650234545633 is an equidigital number, since it uses as much as digits as its factorization.
264650234545633 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624000, while the sum is 58.
The spelling of 264650234545633 in words is "two hundred sixty-four trillion, six hundred fifty billion, two hundred thirty-four million, five hundred forty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •