Base | Representation |
---|---|
bin | 101001000101010… |
… | …010101000000000 |
3 | 1210000221200011212 |
4 | 221011102220000 |
5 | 2402422042424 |
6 | 152221025252 |
7 | 23036360366 |
oct | 5105225000 |
9 | 1700850155 |
10 | 689252864 |
11 | 324079973 |
12 | 1729b5228 |
13 | aca48741 |
14 | 6777b636 |
15 | 4079d10e |
hex | 29152a00 |
689252864 has 40 divisors (see below), whose sum is σ = 1380784020. Its totient is φ = 343719936.
The previous prime is 689252857. The next prime is 689252867. The reversal of 689252864 is 468252986.
It can be written as a sum of positive squares in 2 ways, for example, as 586027264 + 103225600 = 24208^2 + 10160^2 .
It is not an unprimeable number, because it can be changed into a prime (689252867) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 220142 + ... + 223250.
Almost surely, 2689252864 is an apocalyptic number.
689252864 is a gapful number since it is divisible by the number (64) 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 689252864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (690392010).
689252864 is an abundant number, since it is smaller than the sum of its proper divisors (691531156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
689252864 is an equidigital number, since it uses as much as digits as its factorization.
689252864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3560 (or 3544 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 50.
The square root of 689252864 is about 26253.6257305539. The cubic root of 689252864 is about 883.3365345875.
The spelling of 689252864 in words is "six hundred eighty-nine million, two hundred fifty-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •