Base | Representation |
---|---|
bin | 10011111101111001001… |
… | …11101110010100010001 |
3 | 2102120212000002000100001 |
4 | 21332330213232110101 |
5 | 42220024432030001 |
6 | 1243101255330001 |
7 | 100365212405011 |
oct | 11767447562421 |
9 | 2376760060301 |
10 | 686064330001 |
11 | 244a5a479556 |
12 | b0b69680901 |
13 | 4c907292b6b |
14 | 252c45b5c41 |
15 | 12ca5930001 |
hex | 9fbc9ee511 |
686064330001 has 4 divisors (see below), whose sum is σ = 686076535012. Its totient is φ = 686052124992.
The previous prime is 686064329971. The next prime is 686064330019. The reversal of 686064330001 is 100033460686.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 258673960000 + 427390370001 = 508600^2 + 653751^2 .
It is a cyclic number.
It is not a de Polignac number, because 686064330001 - 213 = 686064321809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (686064330041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6017796 + ... + 6130741.
It is an arithmetic number, because the mean of its divisors is an integer number (171519133753).
Almost surely, 2686064330001 is an apocalyptic number.
It is an amenable number.
686064330001 is a deficient number, since it is larger than the sum of its proper divisors (12205011).
686064330001 is a wasteful number, since it uses less digits than its factorization.
686064330001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12205010.
The product of its (nonzero) digits is 62208, while the sum is 37.
Adding to 686064330001 its reverse (100033460686), we get a palindrome (786097790687).
The spelling of 686064330001 in words is "six hundred eighty-six billion, sixty-four million, three hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •