Base | Representation |
---|---|
bin | 1000001011010… |
… | …00110101110101 |
3 | 11210001120111102 |
4 | 10011220311311 |
5 | 120024234434 |
6 | 10450015445 |
7 | 1461656501 |
oct | 405506565 |
9 | 153046442 |
10 | 68586869 |
11 | 3579636a |
12 | 1ab77585 |
13 | 11295560 |
14 | 9175301 |
15 | 604c07e |
hex | 4168d75 |
68586869 has 8 divisors (see below), whose sum is σ = 73929240. Its totient is φ = 63254016.
The previous prime is 68586853. The next prime is 68586877. The reversal of 68586869 is 96868586.
It can be written as a sum of positive squares in 4 ways, for example, as 1592644 + 66994225 = 1262^2 + 8185^2 .
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 68586869 - 24 = 68586853 is a prime.
It is a super-2 number, since 2×685868692 = 9408317198446322, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68586829) 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, 21617 + ... + 24585.
It is an arithmetic number, because the mean of its divisors is an integer number (9241155).
Almost surely, 268586869 is an apocalyptic number.
It is an amenable number.
68586869 is a deficient number, since it is larger than the sum of its proper divisors (5342371).
68586869 is a wasteful number, since it uses less digits than its factorization.
68586869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4759.
The product of its digits is 4976640, while the sum is 56.
The square root of 68586869 is about 8281.7189640799. The cubic root of 68586869 is about 409.3363624471.
The spelling of 68586869 in words is "sixty-eight million, five hundred eighty-six thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •