Base | Representation |
---|---|
bin | 1000001001011… |
… | …11001011010101 |
3 | 11202121120111120 |
4 | 10010233023111 |
5 | 114444210202 |
6 | 10440554153 |
7 | 1456654053 |
oct | 404571325 |
9 | 152546446 |
10 | 68350677 |
11 | 3564496a |
12 | 1aa82959 |
13 | 11211bb5 |
14 | 91131d3 |
15 | 60020bc |
hex | 412f2d5 |
68350677 has 8 divisors (see below), whose sum is σ = 91406016. Its totient is φ = 45431232.
The previous prime is 68350663. The next prime is 68350679. The reversal of 68350677 is 77605386.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 68350677 - 24 = 68350661 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68350679) 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, 32793 + ... + 34814.
It is an arithmetic number, because the mean of its divisors is an integer number (11425752).
Almost surely, 268350677 is an apocalyptic number.
It is an amenable number.
68350677 is a deficient number, since it is larger than the sum of its proper divisors (23055339).
68350677 is a wasteful number, since it uses less digits than its factorization.
68350677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67947.
The product of its (nonzero) digits is 211680, while the sum is 42.
The square root of 68350677 is about 8267.4468247458. The cubic root of 68350677 is about 408.8659460282.
It can be divided in two parts, 683 and 50677, that added together give a triangular number (51360 = T320).
The spelling of 68350677 in words is "sixty-eight million, three hundred fifty thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •