Base | Representation |
---|---|
bin | 10100000100110010010… |
… | …11010011000011111011 |
3 | 2102221101212212101121010 |
4 | 22002121023103003323 |
5 | 42300114222034232 |
6 | 1244512402045003 |
7 | 100556003504523 |
oct | 12023113230373 |
9 | 2387355771533 |
10 | 689764643067 |
11 | 246589182525 |
12 | b1820949763 |
13 | 50076a96116 |
14 | 25555bd8683 |
15 | 12e207090cc |
hex | a0992d30fb |
689764643067 has 8 divisors (see below), whose sum is σ = 949353487360. Its totient is φ = 445009447080.
The previous prime is 689764643059. The next prime is 689764643077. The reversal of 689764643067 is 760346467986.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 689764643067 - 23 = 689764643059 is a prime.
It is a super-2 number, since 2×6897646430672 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 689764642989 and 689764643007.
It is not an unprimeable number, because it can be changed into a prime (689764643077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3708411967 + ... + 3708412152.
It is an arithmetic number, because the mean of its divisors is an integer number (118669185920).
Almost surely, 2689764643067 is an apocalyptic number.
689764643067 is a deficient number, since it is larger than the sum of its proper divisors (259588844293).
689764643067 is a wasteful number, since it uses less digits than its factorization.
689764643067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7416824153.
The product of its (nonzero) digits is 219469824, while the sum is 66.
The spelling of 689764643067 in words is "six hundred eighty-nine billion, seven hundred sixty-four million, six hundred forty-three thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •