Base | Representation |
---|---|
bin | 1111101010000000101101 |
3 | 21201111221210 |
4 | 33222000231 |
5 | 2022313422 |
6 | 223545033 |
7 | 46612464 |
oct | 17520055 |
9 | 7644853 |
10 | 4104237 |
11 | 2353635 |
12 | 145b179 |
13 | b09157 |
14 | 78b9db |
15 | 56110c |
hex | 3ea02d |
4104237 has 4 divisors (see below), whose sum is σ = 5472320. Its totient is φ = 2736156.
The previous prime is 4104203. The next prime is 4104239. The reversal of 4104237 is 7324014.
4104237 is digitally balanced in base 2, 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.
It is not a de Polignac number, because 4104237 - 210 = 4103213 is a prime.
It is a super-2 number, since 2×41042372 = 33689522704338, which contains 22 as substring.
It is a D-number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4104239) 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 3 ways as a sum of consecutive naturals, for example, 684037 + ... + 684042.
It is an arithmetic number, because the mean of its divisors is an integer number (1368080).
Almost surely, 24104237 is an apocalyptic number.
It is an amenable number.
4104237 is a deficient number, since it is larger than the sum of its proper divisors (1368083).
4104237 is a wasteful number, since it uses less digits than its factorization.
4104237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368082.
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 4104237 is about 2025.8916555433. The cubic root of 4104237 is about 160.1071807899.
The spelling of 4104237 in words is "four million, one hundred four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •