Base | Representation |
---|---|
bin | 1000000111011… |
… | …10000001011111 |
3 | 11202010000102111 |
4 | 10003232001133 |
5 | 114412140212 |
6 | 10431134451 |
7 | 1454463031 |
oct | 403560137 |
9 | 152100374 |
10 | 68083807 |
11 | 35482410 |
12 | 1a974427 |
13 | 1114a59c |
14 | 9083c51 |
15 | 5e9cea7 |
hex | 40ee05f |
68083807 has 8 divisors (see below), whose sum is σ = 74338560. Its totient is φ = 61839960.
The previous prime is 68083801. The next prime is 68083831. The reversal of 68083807 is 70838086.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68083807 is a prime.
It is a super-2 number, since 2×680838072 = 9270809551226498, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 68083807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68083801) 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, 15898 + ... + 19720.
It is an arithmetic number, because the mean of its divisors is an integer number (9292320).
Almost surely, 268083807 is an apocalyptic number.
68083807 is a deficient number, since it is larger than the sum of its proper divisors (6254753).
68083807 is a wasteful number, since it uses less digits than its factorization.
68083807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5453.
The product of its (nonzero) digits is 64512, while the sum is 40.
The square root of 68083807 is about 8251.2912322860. The cubic root of 68083807 is about 408.3331233466. Note that the first 3 decimals are identical.
The spelling of 68083807 in words is "sixty-eight million, eighty-three thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •