Base | Representation |
---|---|
bin | 101001000101010… |
… | …100011010110100 |
3 | 1210000222001021000 |
4 | 221011110122310 |
5 | 2402422311322 |
6 | 152221123300 |
7 | 23036420664 |
oct | 5105243264 |
9 | 1700861230 |
10 | 689260212 |
11 | 324084443 |
12 | 1729b9530 |
13 | aca4bba4 |
14 | 677801a4 |
15 | 407a03ac |
hex | 291546b4 |
689260212 has 24 divisors (see below), whose sum is σ = 1786971200. Its totient is φ = 229753368.
The previous prime is 689260211. The next prime is 689260213. The reversal of 689260212 is 212062986.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (689260211) and next prime (689260213).
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (689260211) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3190912 + ... + 3191127.
Almost surely, 2689260212 is an apocalyptic number.
It is an amenable number.
689260212 is an abundant number, since it is smaller than the sum of its proper divisors (1097710988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
689260212 is a wasteful number, since it uses less digits than its factorization.
689260212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6382052 (or 6382044 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 689260212 is about 26253.7656727564. The cubic root of 689260212 is about 883.3396736066.
The spelling of 689260212 in words is "six hundred eighty-nine million, two hundred sixty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •