Base | Representation |
---|---|
bin | 10101110011011111100 |
3 | 1100022002200 |
4 | 2232123330 |
5 | 140330432 |
6 | 23151500 |
7 | 6034032 |
oct | 2563374 |
9 | 1308080 |
10 | 714492 |
11 | 448899 |
12 | 2a5590 |
13 | 1c029c |
14 | 148552 |
15 | e1a7c |
hex | ae6fc |
714492 has 36 divisors (see below), whose sum is σ = 1834560. Its totient is φ = 234432.
The previous prime is 714487. The next prime is 714503. The reversal of 714492 is 294417.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a plaindrome in base 11.
It is a zygodrome in base 3 and base 11.
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 714492.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3093 + ... + 3315.
It is an arithmetic number, because the mean of its divisors is an integer number (50960).
2714492 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 714492, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (917280).
714492 is an abundant number, since it is smaller than the sum of its proper divisors (1120068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
714492 is a wasteful number, since it uses less digits than its factorization.
714492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322 (or 317 counting only the distinct ones).
The product of its digits is 2016, while the sum is 27.
The square root of 714492 is about 845.2762861929. The cubic root of 714492 is about 89.3989579927.
The spelling of 714492 in words is "seven hundred fourteen thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •