Base | Representation |
---|---|
bin | 11110010110111000000 |
3 | 1212112112200 |
4 | 3302313000 |
5 | 223313002 |
6 | 33153200 |
7 | 11312103 |
oct | 3626700 |
9 | 1775480 |
10 | 994752 |
11 | 61a410 |
12 | 3bb800 |
13 | 28aa15 |
14 | 1bc73a |
15 | 149b1c |
hex | f2dc0 |
994752 has 84 divisors (see below), whose sum is σ = 3130296. Its totient is φ = 299520.
The previous prime is 994751. The next prime is 994769. The reversal of 994752 is 257499.
994752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 994752.
It is not an unprimeable number, because it can be changed into a prime (994751) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6258 + ... + 6414.
2994752 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 994752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1565148).
994752 is an abundant number, since it is smaller than the sum of its proper divisors (2135544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
994752 is a wasteful number, since it uses less digits than its factorization.
994752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186 (or 173 counting only the distinct ones).
The product of its digits is 22680, while the sum is 36.
The square root of 994752 is about 997.3725482486. The cubic root of 994752 is about 99.8247597546.
It can be divided in two parts, 9947 and 52, that added together give a palindrome (9999).
The spelling of 994752 in words is "nine hundred ninety-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •