Base | Representation |
---|---|
bin | 111111100001101100… |
… | …100000110011100110 |
3 | 20112001202010110020000 |
4 | 333201230200303212 |
5 | 2104144012124000 |
6 | 51200303322130 |
7 | 4633222242042 |
oct | 774154406346 |
9 | 215052113200 |
10 | 68211051750 |
11 | 26a233a6846 |
12 | 112778b0346 |
13 | 6580926aaa |
14 | 34311b9022 |
15 | 1b9353c000 |
hex | fe1b20ce6 |
68211051750 has 160 divisors (see below), whose sum is σ = 191207839680. Its totient is φ = 18145814400.
The previous prime is 68211051709. The next prime is 68211051751. The reversal of 68211051750 is 5715011286.
68211051750 is a `hidden beast` number, since 6 + 82 + 1 + 10 + 517 + 50 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68211051751) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 8885914 + ... + 8893586.
It is an arithmetic number, because the mean of its divisors is an integer number (1195048998).
Almost surely, 268211051750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68211051750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95603919840).
68211051750 is an abundant number, since it is smaller than the sum of its proper divisors (122996787930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68211051750 is a wasteful number, since it uses less digits than its factorization.
68211051750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8141 (or 8122 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
The spelling of 68211051750 in words is "sixty-eight billion, two hundred eleven million, fifty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •