Base | Representation |
---|---|
bin | 111111010010110010… |
… | …000001111010111000 |
3 | 20111102022022101001010 |
4 | 333102302001322320 |
5 | 2103140433333424 |
6 | 51115404353520 |
7 | 4624063415241 |
oct | 772262017270 |
9 | 214368271033 |
10 | 67960839864 |
11 | 26905138965 |
12 | 11207b458a0 |
13 | 6540b3bb18 |
14 | 3409c85cc8 |
15 | 1b7b5b5229 |
hex | fd2c81eb8 |
67960839864 has 64 divisors (see below), whose sum is σ = 174004871040. Its totient is φ = 22107496320.
The previous prime is 67960839851. The next prime is 67960839913. The reversal of 67960839864 is 46893806976.
It is a junction number, because it is equal to n+sod(n) for n = 67960839795 and 67960839804.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1180354 + ... + 1236590.
It is an arithmetic number, because the mean of its divisors is an integer number (2718826110).
Almost surely, 267960839864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 67960839864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87002435520).
67960839864 is an abundant number, since it is smaller than the sum of its proper divisors (106044031176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67960839864 is a wasteful number, since it uses less digits than its factorization.
67960839864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57460 (or 57456 counting only the distinct ones).
The product of its (nonzero) digits is 94058496, while the sum is 66.
The spelling of 67960839864 in words is "sixty-seven billion, nine hundred sixty million, eight hundred thirty-nine thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •