Base | Representation |
---|---|
bin | 1000010111110000010100 |
3 | 11010111020000 |
4 | 20113300110 |
5 | 1030210302 |
6 | 115011300 |
7 | 24436551 |
oct | 10276024 |
9 | 4114200 |
10 | 2194452 |
11 | 12697a7 |
12 | 899b30 |
13 | 5baac0 |
14 | 411a28 |
15 | 2d531c |
hex | 217c14 |
2194452 has 60 divisors (see below), whose sum is σ = 6189876. Its totient is φ = 673920.
The previous prime is 2194447. The next prime is 2194457. The reversal of 2194452 is 2544912.
2194452 is a `hidden beast` number, since 219 + 445 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (2194447) and next prime (2194457).
It can be written as a sum of positive squares in 2 ways, for example, as 467856 + 1726596 = 684^2 + 1314^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2194457) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3952 + ... + 4472.
22194452 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 2194452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3094938).
2194452 is an abundant number, since it is smaller than the sum of its proper divisors (3995424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2194452 is a wasteful number, since it uses less digits than its factorization.
2194452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550 (or 539 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 2194452 is about 1481.3682864163. The cubic root of 2194452 is about 129.9497241487.
The spelling of 2194452 in words is "two million, one hundred ninety-four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •