Base | Representation |
---|---|
bin | 111111100111010011… |
… | …001101110111000000 |
3 | 20112022022001210000000 |
4 | 333213103031313000 |
5 | 2104342100140330 |
6 | 51213503000000 |
7 | 4635443430060 |
oct | 774723156700 |
9 | 215268053000 |
10 | 68305083840 |
11 | 26a71491514 |
12 | 112a3299000 |
13 | 659725b096 |
14 | 343d8953a0 |
15 | 1b9b913560 |
hex | fe74cddc0 |
68305083840 has 896 divisors, whose sum is σ = 284087255040. Its totient is φ = 15318097920.
The previous prime is 68305083799. The next prime is 68305083841. The reversal of 68305083840 is 4838050386.
68305083840 is a `hidden beast` number, since 68 + 3 + 0 + 508 + 3 + 84 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68305083841) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 357618145 + ... + 357618335.
Almost surely, 268305083840 is an apocalyptic number.
68305083840 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68305083840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142043627520).
68305083840 is an abundant number, since it is smaller than the sum of its proper divisors (215782171200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68305083840 is an equidigital number, since it uses as much as digits as its factorization.
68305083840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309 (or 281 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The spelling of 68305083840 in words is "sixty-eight billion, three hundred five million, eighty-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •