Base | Representation |
---|---|
bin | 10101111001001011111101 |
3 | 101210120210020 |
4 | 111321023331 |
5 | 2432124021 |
6 | 323002353 |
7 | 66532353 |
oct | 25711375 |
9 | 11716706 |
10 | 5739261 |
11 | 326aaa0 |
12 | 1b093b9 |
13 | 125c418 |
14 | a957d3 |
15 | 7857c6 |
hex | 5792fd |
5739261 has 8 divisors (see below), whose sum is σ = 8348064. Its totient is φ = 3478320.
The previous prime is 5739233. The next prime is 5739269. The reversal of 5739261 is 1629375.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5739261 - 25 = 5739229 is a prime.
It is a super-2 number, since 2×57392612 = 65878233652242, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 173917 = 5739261 / (5 + 7 + 3 + 9 + 2 + 6 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5739269) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86926 + ... + 86991.
It is an arithmetic number, because the mean of its divisors is an integer number (1043508).
Almost surely, 25739261 is an apocalyptic number.
It is an amenable number.
5739261 is a deficient number, since it is larger than the sum of its proper divisors (2608803).
5739261 is a wasteful number, since it uses less digits than its factorization.
5739261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173931.
The product of its digits is 11340, while the sum is 33.
The square root of 5739261 is about 2395.6754788577. The cubic root of 5739261 is about 179.0407925923.
The spelling of 5739261 in words is "five million, seven hundred thirty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •