Base | Representation |
---|---|
bin | 1100011101101110001100 |
3 | 20011000010100 |
4 | 30131232030 |
5 | 1314024333 |
6 | 154011100 |
7 | 36526101 |
oct | 14355614 |
9 | 6130110 |
10 | 3267468 |
11 | 1931996 |
12 | 1116a90 |
13 | 8a5319 |
14 | 610aa8 |
15 | 448213 |
hex | 31db8c |
3267468 has 72 divisors (see below), whose sum is σ = 9238320. Its totient is φ = 967680.
The previous prime is 3267463. The next prime is 3267497. The reversal of 3267468 is 8647623.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a d-powerful number, because it can be written as 312 + 2 + 65 + 72 + 410 + 68 + 8 .
It is not an unprimeable number, because it can be changed into a prime (3267463) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11488 + ... + 11768.
It is an arithmetic number, because the mean of its divisors is an integer number (128310).
Almost surely, 23267468 is an apocalyptic number.
3267468 is a gapful number since it is divisible by the number (38) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3267468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4619160).
3267468 is an abundant number, since it is smaller than the sum of its proper divisors (5970852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3267468 is a wasteful number, since it uses less digits than its factorization.
3267468 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327 (or 322 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 3267468 is about 1807.6138968264. The cubic root of 3267468 is about 148.3897082635.
The spelling of 3267468 in words is "three million, two hundred sixty-seven thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •