Base | Representation |
---|---|
bin | 10100000100010001010001 |
3 | 100220020212111 |
4 | 110010101101 |
5 | 2321312434 |
6 | 304425321 |
7 | 62466232 |
oct | 24042121 |
9 | 10806774 |
10 | 5260369 |
11 | 2a73214 |
12 | 1918241 |
13 | 112245a |
14 | 9ad089 |
15 | 6dd964 |
hex | 504451 |
5260369 has 2 divisors, whose sum is σ = 5260370. Its totient is φ = 5260368.
The previous prime is 5260363. The next prime is 5260379. The reversal of 5260369 is 9630625.
5260369 is digitally balanced in base 3, 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., 4601025 + 659344 = 2145^2 + 812^2 .
It is a cyclic number.
It is not a de Polignac number, because 5260369 - 25 = 5260337 is a prime.
It is a super-2 number, since 2×52603692 = 55342964032322, which contains 22 as substring.
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 5260369.
It is not a weakly prime, because it can be changed into another prime (5260363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2630184 + 2630185.
It is an arithmetic number, because the mean of its divisors is an integer number (2630185).
Almost surely, 25260369 is an apocalyptic number.
It is an amenable number.
5260369 is a deficient number, since it is larger than the sum of its proper divisors (1).
5260369 is an equidigital number, since it uses as much as digits as its factorization.
5260369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 5260369 is about 2293.5494326480. The cubic root of 5260369 is about 173.9156789664.
The spelling of 5260369 in words is "five million, two hundred sixty thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •