Base | Representation |
---|---|
bin | 10101101001010011100100 |
3 | 101200021120000 |
4 | 111221103210 |
5 | 2423033322 |
6 | 321341300 |
7 | 66141615 |
oct | 25512344 |
9 | 11607500 |
10 | 5674212 |
11 | 3226135 |
12 | 1a97830 |
13 | 123892b |
14 | a79c0c |
15 | 7713ac |
hex | 5694e4 |
5674212 has 60 divisors (see below), whose sum is σ = 15083376. Its totient is φ = 1859760.
The previous prime is 5674199. The next prime is 5674219. The reversal of 5674212 is 2124765.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (5674219) 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 19 ways as a sum of consecutive naturals, for example, 26787 + ... + 26997.
Almost surely, 25674212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5674212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7541688).
5674212 is an abundant number, since it is smaller than the sum of its proper divisors (9409164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5674212 is a wasteful number, since it uses less digits than its factorization.
5674212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310 (or 299 counting only the distinct ones).
The product of its digits is 3360, while the sum is 27.
The square root of 5674212 is about 2382.0604526334. The cubic root of 5674212 is about 178.3618025026.
Adding to 5674212 its reverse (2124765), we get a palindrome (7798977).
It can be divided in two parts, 5674 and 212, that added together give a triangular number (5886 = T108).
The spelling of 5674212 in words is "five million, six hundred seventy-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •