Base | Representation |
---|---|
bin | 1101001110001100110100 |
3 | 20112002111201 |
4 | 31032030310 |
5 | 1341403121 |
6 | 202142244 |
7 | 41314030 |
oct | 15161464 |
9 | 6462451 |
10 | 3466036 |
11 | 1a580a2 |
12 | 11b1984 |
13 | 944812 |
14 | 6631c0 |
15 | 486e91 |
hex | 34e334 |
3466036 has 12 divisors (see below), whose sum is σ = 6932128. Its totient is φ = 1485432.
The previous prime is 3466033. The next prime is 3466069. The reversal of 3466036 is 6306643.
3466036 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
3466036 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 123787 = 3466036 / (3 + 4 + 6 + 6 + 0 + 3 + 6).
It is a junction number, because it is equal to n+sod(n) for n = 3465995 and 3466013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3466033) 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, 61866 + ... + 61921.
Almost surely, 23466036 is an apocalyptic number.
It is an amenable number.
3466036 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3466036 is a wasteful number, since it uses less digits than its factorization.
3466036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123798 (or 123796 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
The square root of 3466036 is about 1861.7293036314. The cubic root of 3466036 is about 151.3367337154.
The spelling of 3466036 in words is "three million, four hundred sixty-six thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •