Base | Representation |
---|---|
bin | 1000001110000… |
… | …11100111011001 |
3 | 11210202110112020 |
4 | 10013003213121 |
5 | 120123134211 |
6 | 10502005053 |
7 | 1465065501 |
oct | 407034731 |
9 | 153673466 |
10 | 68958681 |
11 | 35a1a750 |
12 | 1b116789 |
13 | 1139586c |
14 | 9230a01 |
15 | 60c2306 |
hex | 41c39d9 |
68958681 has 16 divisors (see below), whose sum is σ = 106204608. Its totient is φ = 39334400.
The previous prime is 68958661. The next prime is 68958689. The reversal of 68958681 is 18685986.
It is a cyclic number.
It is not a de Polignac number, because 68958681 - 27 = 68958553 is a prime.
It is a super-2 number, since 2×689586812 = 9510599370519522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (68958689) 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 15 ways as a sum of consecutive naturals, for example, 60900 + ... + 62021.
It is an arithmetic number, because the mean of its divisors is an integer number (6637788).
It is a Poulet number, since it divides 268958680-1.
Almost surely, 268958681 is an apocalyptic number.
It is an amenable number.
68958681 is a deficient number, since it is larger than the sum of its proper divisors (37245927).
68958681 is a wasteful number, since it uses less digits than its factorization.
68958681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122952.
The product of its digits is 829440, while the sum is 51.
The square root of 68958681 is about 8304.1363789379. The cubic root of 68958681 is about 410.0747058001.
It can be divided in two parts, 6895 and 8681, that added together give a triangular number (15576 = T176).
The spelling of 68958681 in words is "sixty-eight million, nine hundred fifty-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •