Base | Representation |
---|---|
bin | 1000001100000… |
… | …11101110011101 |
3 | 11210021011112221 |
4 | 10012003232131 |
5 | 120041300424 |
6 | 10452225341 |
7 | 1462625524 |
oct | 406035635 |
9 | 153234487 |
10 | 68696989 |
11 | 35861079 |
12 | 1b00b251 |
13 | 1130370a |
14 | 91a34bb |
15 | 606e9e4 |
hex | 4183b9d |
68696989 has 8 divisors (see below), whose sum is σ = 72680000. Its totient is φ = 64750752.
The previous prime is 68696987. The next prime is 68697029. The reversal of 68696989 is 98969686.
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 68696989 - 21 = 68696987 is a prime.
It is a super-2 number, since 2×686969892 = 9438552595332242, which contains 22 as substring.
68696989 is a strobogrammatic number because it is the same when read upside-down.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68696981) 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, 5304 + ... + 12865.
It is an arithmetic number, because the mean of its divisors is an integer number (9085000).
Almost surely, 268696989 is an apocalyptic number.
It is an amenable number.
68696989 is a deficient number, since it is larger than the sum of its proper divisors (3983011).
68696989 is a wasteful number, since it uses less digits than its factorization.
68696989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18387.
The product of its digits is 10077696, while the sum is 61.
The square root of 68696989 is about 8288.3646758574. The cubic root of 68696989 is about 409.5553160083. Note that the first 3 decimals are identical.
The spelling of 68696989 in words is "sixty-eight million, six hundred ninety-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •