Base | Representation |
---|---|
bin | 1110111001001010000101 |
3 | 21100100110112 |
4 | 32321022011 |
5 | 1444413013 |
6 | 215402405 |
7 | 45120212 |
oct | 16711205 |
9 | 7310415 |
10 | 3904133 |
11 | 2227262 |
12 | 1383405 |
13 | a6904c |
14 | 738b09 |
15 | 521ba8 |
hex | 3b9285 |
3904133 has 4 divisors (see below), whose sum is σ = 3922848. Its totient is φ = 3885420.
The previous prime is 3904127. The next prime is 3904141. The reversal of 3904133 is 3314093.
3904133 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 a cyclic number.
It is not a de Polignac number, because 3904133 - 28 = 3903877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3904099 and 3904108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3904123) 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, 9041 + ... + 9462.
It is an arithmetic number, because the mean of its divisors is an integer number (980712).
Almost surely, 23904133 is an apocalyptic number.
It is an amenable number.
3904133 is a deficient number, since it is larger than the sum of its proper divisors (18715).
3904133 is a wasteful number, since it uses less digits than its factorization.
3904133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18714.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 3904133 is about 1975.8879016786. The cubic root of 3904133 is about 157.4616753985.
The spelling of 3904133 in words is "three million, nine hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •