Base | Representation |
---|---|
bin | 10101011001111001010101 |
3 | 101120001222021 |
4 | 111121321111 |
5 | 2414023333 |
6 | 320133141 |
7 | 65456605 |
oct | 25317125 |
9 | 11501867 |
10 | 5611093 |
11 | 3192774 |
12 | 1a671b1 |
13 | 1215c97 |
14 | a60c05 |
15 | 75c82d |
hex | 559e55 |
5611093 has 4 divisors (see below), whose sum is σ = 5792128. Its totient is φ = 5430060.
The previous prime is 5611091. The next prime is 5611117. The reversal of 5611093 is 3901165.
5611093 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3901165 = 5 ⋅780233.
It is a cyclic number.
It is not a de Polignac number, because 5611093 - 21 = 5611091 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5611091) 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 in 3 ways as a sum of consecutive naturals, for example, 90471 + ... + 90532.
It is an arithmetic number, because the mean of its divisors is an integer number (1448032).
Almost surely, 25611093 is an apocalyptic number.
It is an amenable number.
5611093 is a deficient number, since it is larger than the sum of its proper divisors (181035).
5611093 is a wasteful number, since it uses less digits than its factorization.
5611093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181034.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 5611093 is about 2368.7745777089. The cubic root of 5611093 is about 177.6979791893.
The spelling of 5611093 in words is "five million, six hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •