Base | Representation |
---|---|
bin | 10110100010101001011001 |
3 | 102010012201212 |
4 | 112202221121 |
5 | 3003042311 |
6 | 330352505 |
7 | 101140433 |
oct | 26425131 |
9 | 12105655 |
10 | 5909081 |
11 | 3376642 |
12 | 1b8b735 |
13 | 12bb7c9 |
14 | adb653 |
15 | 7bac8b |
hex | 5a2a59 |
5909081 has 8 divisors (see below), whose sum is σ = 6292584. Its totient is φ = 5529600.
The previous prime is 5909053. The next prime is 5909087. The reversal of 5909081 is 1809095.
5909081 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 225625 + 5683456 = 475^2 + 2384^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5909081 - 222 = 1714777 is a prime.
It is a super-2 number, since 2×59090812 = 69834476529122, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5909087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2381 + ... + 4181.
It is an arithmetic number, because the mean of its divisors is an integer number (786573).
Almost surely, 25909081 is an apocalyptic number.
It is an amenable number.
5909081 is a deficient number, since it is larger than the sum of its proper divisors (383503).
5909081 is a wasteful number, since it uses less digits than its factorization.
5909081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011.
The product of its (nonzero) digits is 3240, while the sum is 32.
The square root of 5909081 is about 2430.8601358367. The cubic root of 5909081 is about 180.7895461005.
The spelling of 5909081 in words is "five million, nine hundred nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •