Base | Representation |
---|---|
bin | 101001001000000… |
… | …001101100001011 |
3 | 1210002022002210220 |
4 | 221020001230023 |
5 | 2403113014211 |
6 | 152244241123 |
7 | 23045435100 |
oct | 5110015413 |
9 | 1702262726 |
10 | 689969931 |
11 | 324519692 |
12 | 1730a01a3 |
13 | acc39c41 |
14 | 678c6aa7 |
15 | 40890806 |
hex | 29201b0b |
689969931 has 12 divisors (see below), whose sum is σ = 1070157672. Its totient is φ = 394268448.
The previous prime is 689969927. The next prime is 689969957. The reversal of 689969931 is 139969986.
It is not a de Polignac number, because 689969931 - 22 = 689969927 is a prime.
It is a super-2 number, since 2×6899699312 = 952117011368289522, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (689969981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2346690 + ... + 2346983.
It is an arithmetic number, because the mean of its divisors is an integer number (89179806).
Almost surely, 2689969931 is an apocalyptic number.
689969931 is a deficient number, since it is larger than the sum of its proper divisors (380187741).
689969931 is a wasteful number, since it uses less digits than its factorization.
689969931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4693690 (or 4693683 counting only the distinct ones).
The product of its digits is 5668704, while the sum is 60.
The square root of 689969931 is about 26267.2787132584. The cubic root of 689969931 is about 883.6427559959.
Subtracting from 689969931 its reverse (139969986), we obtain a palindrome (549999945).
It can be divided in two parts, 689969 and 931, that added together give a triangular number (690900 = T1175).
The spelling of 689969931 in words is "six hundred eighty-nine million, nine hundred sixty-nine thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •