Base | Representation |
---|---|
bin | 101001100011001… |
… | …101001000000000 |
3 | 1210120201002002121 |
4 | 221203031020000 |
5 | 2411424012111 |
6 | 153101054024 |
7 | 23163130636 |
oct | 5143151000 |
9 | 1716632077 |
10 | 697094656 |
11 | 328545595 |
12 | 175557314 |
13 | b1562b5b |
14 | 6881d356 |
15 | 412eb871 |
hex | 298cd200 |
697094656 has 60 divisors (see below), whose sum is σ = 1479988422. Its totient is φ = 326885376.
The previous prime is 697094653. The next prime is 697094683. The reversal of 697094656 is 656490796.
It can be written as a sum of positive squares in only one way, i.e., 512569600 + 184525056 = 22640^2 + 13584^2 .
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (697094653) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2463091 + ... + 2463373.
Almost surely, 2697094656 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 697094656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (739994211).
697094656 is an abundant number, since it is smaller than the sum of its proper divisors (782893766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
697094656 is an frugal number, since it uses more digits than its factorization.
697094656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601 (or 302 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 52.
The square root of 697094656 is about 26402.5501798595. The cubic root of 697094656 is about 886.6738856580.
The spelling of 697094656 in words is "six hundred ninety-seven million, ninety-four thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •