Base | Representation |
---|---|
bin | 101000111010010… |
… | …100010111001101 |
3 | 1202211112112102001 |
4 | 220322110113031 |
5 | 2401203021042 |
6 | 152035232301 |
7 | 23003050240 |
oct | 5072242715 |
9 | 1684475361 |
10 | 686376397 |
11 | 322494823 |
12 | 171a48691 |
13 | ac27c3a5 |
14 | 6722d257 |
15 | 403d0bb7 |
hex | 28e945cd |
686376397 has 8 divisors (see below), whose sum is σ = 789696000. Its totient is φ = 584373264.
The previous prime is 686376371. The next prime is 686376401. The reversal of 686376397 is 793673686.
686376397 is nontrivially palindromic in base 5.
686376397 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 686376397 - 27 = 686376269 is a prime.
It is a super-2 number, since 2×6863763972 = 942225116717403218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (686376997) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 327997 + ... + 330082.
It is an arithmetic number, because the mean of its divisors is an integer number (98712000).
Almost surely, 2686376397 is an apocalyptic number.
It is an amenable number.
686376397 is a deficient number, since it is larger than the sum of its proper divisors (103319603).
686376397 is a wasteful number, since it uses less digits than its factorization.
686376397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658235.
The product of its digits is 6858432, while the sum is 55.
The square root of 686376397 is about 26198.7861741723. The cubic root of 686376397 is about 882.1060083263.
The spelling of 686376397 in words is "six hundred eighty-six million, three hundred seventy-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •