Base | Representation |
---|---|
bin | 1000001011001… |
… | …11100100010010 |
3 | 11210001022100010 |
4 | 10011213210102 |
5 | 120024103100 |
6 | 10445535350 |
7 | 1461635334 |
oct | 405474422 |
9 | 153038303 |
10 | 68581650 |
11 | 35792455 |
12 | 1ab74556 |
13 | 11293077 |
14 | 9173454 |
15 | 604a750 |
hex | 4167912 |
68581650 has 48 divisors (see below), whose sum is σ = 171712224. Its totient is φ = 18113280.
The previous prime is 68581649. The next prime is 68581663. The reversal of 68581650 is 5618586.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 68581599 and 68581608.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 13914 + ... + 18186.
It is an arithmetic number, because the mean of its divisors is an integer number (3577338).
Almost surely, 268581650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68581650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85856112).
68581650 is an abundant number, since it is smaller than the sum of its proper divisors (103130574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68581650 is a wasteful number, since it uses less digits than its factorization.
68581650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4395 (or 4390 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 39.
The square root of 68581650 is about 8281.4038664951. The cubic root of 68581650 is about 409.3259796012.
The spelling of 68581650 in words is "sixty-eight million, five hundred eighty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •