Base | Representation |
---|---|
bin | 11000001000110… |
… | …101001101101001 |
3 | 1001020000112001211 |
4 | 120020311031221 |
5 | 1312132441142 |
6 | 104103513121 |
7 | 13015113406 |
oct | 3010651551 |
9 | 1036015054 |
10 | 404968297 |
11 | 198659748 |
12 | b37587a1 |
13 | 65b90b16 |
14 | 3bad92ad |
15 | 25845917 |
hex | 18235369 |
404968297 has 2 divisors, whose sum is σ = 404968298. Its totient is φ = 404968296.
The previous prime is 404968279. The next prime is 404968363. The reversal of 404968297 is 792869404.
Together with previous prime (404968279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 270964521 + 134003776 = 16461^2 + 11576^2 .
It is a cyclic number.
It is not a de Polignac number, because 404968297 - 211 = 404966249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 404968297.
It is not a weakly prime, because it can be changed into another prime (404968247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202484148 + 202484149.
It is an arithmetic number, because the mean of its divisors is an integer number (202484149).
Almost surely, 2404968297 is an apocalyptic number.
It is an amenable number.
404968297 is a deficient number, since it is larger than the sum of its proper divisors (1).
404968297 is an equidigital number, since it uses as much as digits as its factorization.
404968297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 870912, while the sum is 49.
The square root of 404968297 is about 20123.8241147154. The cubic root of 404968297 is about 739.8443165308.
The spelling of 404968297 in words is "four hundred four million, nine hundred sixty-eight thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •