Base | Representation |
---|---|
bin | 1110010110010100001101 |
3 | 21002002200220 |
4 | 32112110031 |
5 | 1430331141 |
6 | 212341553 |
7 | 43654146 |
oct | 16262415 |
9 | 7062626 |
10 | 3761421 |
11 | 213a014 |
12 | 13148b9 |
13 | a190c1 |
14 | 6dcacd |
15 | 4e4766 |
hex | 39650d |
3761421 has 8 divisors (see below), whose sum is σ = 5026464. Its totient is φ = 2502000.
The previous prime is 3761419. The next prime is 3761423. The reversal of 3761421 is 1241673.
3761421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3761419) and next prime (3761423).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3761421 - 21 = 3761419 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3761391 and 3761400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3761423) 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, 546 + ... + 2796.
It is an arithmetic number, because the mean of its divisors is an integer number (628308).
Almost surely, 23761421 is an apocalyptic number.
It is an amenable number.
3761421 is a deficient number, since it is larger than the sum of its proper divisors (1265043).
3761421 is a wasteful number, since it uses less digits than its factorization.
3761421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2811.
The product of its digits is 1008, while the sum is 24.
The square root of 3761421 is about 1939.4383207517. The cubic root of 3761421 is about 155.5191885696.
The spelling of 3761421 in words is "three million, seven hundred sixty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •