Base | Representation |
---|---|
bin | 1000000100011… |
… | …01110110010001 |
3 | 11201101000001100 |
4 | 10002031312101 |
5 | 114312033443 |
6 | 10414455013 |
7 | 1451232366 |
oct | 402156621 |
9 | 151330040 |
10 | 67689873 |
11 | 35233449 |
12 | 1a804469 |
13 | 110401a4 |
14 | 8dc046d |
15 | 5e213d3 |
hex | 408dd91 |
67689873 has 12 divisors (see below), whose sum is σ = 97896708. Its totient is φ = 45070080.
The previous prime is 67689863. The next prime is 67689887. The reversal of 67689873 is 37898676.
It can be written as a sum of positive squares in 2 ways, for example, as 36687249 + 31002624 = 6057^2 + 5568^2 .
It is not a de Polignac number, because 67689873 - 25 = 67689841 is a prime.
It is a super-2 number, since 2×676898732 = 9163837813512258, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67689863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3661 + ... + 12197.
It is an arithmetic number, because the mean of its divisors is an integer number (8158059).
Almost surely, 267689873 is an apocalyptic number.
It is an amenable number.
67689873 is a deficient number, since it is larger than the sum of its proper divisors (30206835).
67689873 is a wasteful number, since it uses less digits than its factorization.
67689873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9424 (or 9421 counting only the distinct ones).
The product of its digits is 3048192, while the sum is 54.
The square root of 67689873 is about 8227.3855507081. The cubic root of 67689873 is about 407.5440588692.
It can be divided in two parts, 6768 and 9873, that added together give a square (16641 = 1292).
The spelling of 67689873 in words is "sixty-seven million, six hundred eighty-nine thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •