Base | Representation |
---|---|
bin | 10101010001100110100 |
3 | 1022102022000 |
4 | 2222030310 |
5 | 134302030 |
6 | 22535300 |
7 | 5632323 |
oct | 2521464 |
9 | 1272260 |
10 | 697140 |
11 | 436854 |
12 | 297530 |
13 | 1b5412 |
14 | 1420ba |
15 | db860 |
hex | aa334 |
697140 has 48 divisors (see below), whose sum is σ = 2170560. Its totient is φ = 185760.
The previous prime is 697133. The next prime is 697141. The reversal of 697140 is 41796.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 15.
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 697140.
It is not an unprimeable number, because it can be changed into a prime (697141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106 + ... + 1185.
It is an arithmetic number, because the mean of its divisors is an integer number (45220).
2697140 is an apocalyptic number.
697140 is a gapful number since it is divisible by the number (60) 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 697140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1085280).
697140 is an abundant number, since it is smaller than the sum of its proper divisors (1473420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
697140 is a wasteful number, since it uses less digits than its factorization.
697140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1309 (or 1301 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 697140 is about 834.9491002450. The cubic root of 697140 is about 88.6693110436.
The spelling of 697140 in words is "six hundred ninety-seven thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •