Base | Representation |
---|---|
bin | 11111011110001… |
… | …10111111000101 |
3 | 200101202222101001 |
4 | 33233012333011 |
5 | 1020041220441 |
6 | 42110333301 |
7 | 6354012343 |
oct | 1757067705 |
9 | 611688331 |
10 | 264007621 |
11 | 126030919 |
12 | 744ba231 |
13 | 42908437 |
14 | 270c4993 |
15 | 1829e731 |
hex | fbc6fc5 |
264007621 has 2 divisors, whose sum is σ = 264007622. Its totient is φ = 264007620.
The previous prime is 264007613. The next prime is 264007669. The reversal of 264007621 is 126700462.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 263705121 + 302500 = 16239^2 + 550^2 .
It is a cyclic number.
It is not a de Polignac number, because 264007621 - 23 = 264007613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 264007621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (264007421) 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, 132003810 + 132003811.
It is an arithmetic number, because the mean of its divisors is an integer number (132003811).
Almost surely, 2264007621 is an apocalyptic number.
It is an amenable number.
264007621 is a deficient number, since it is larger than the sum of its proper divisors (1).
264007621 is an equidigital number, since it uses as much as digits as its factorization.
264007621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 264007621 is about 16248.3113276426. The cubic root of 264007621 is about 641.5130388234.
It can be divided in two parts, 264007 and 621, that added together give a triangular number (264628 = T727).
The spelling of 264007621 in words is "two hundred sixty-four million, seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •