Base | Representation |
---|---|
bin | 1000001001011… |
… | …00011101011000 |
3 | 11202121000020020 |
4 | 10010230131120 |
5 | 114443331134 |
6 | 10440430440 |
7 | 1456606440 |
oct | 404543530 |
9 | 152530206 |
10 | 68339544 |
11 | 35637569 |
12 | 1aa78420 |
13 | 11209b00 |
14 | 910d120 |
15 | 5eedb49 |
hex | 412c758 |
68339544 has 192 divisors, whose sum is σ = 221356800. Its totient is φ = 17192448.
The previous prime is 68339533. The next prime is 68339587. The reversal of 68339544 is 44593386.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 68339496 and 68339505.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 823327 + ... + 823409.
It is an arithmetic number, because the mean of its divisors is an integer number (1152900).
Almost surely, 268339544 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 68339544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110678400).
68339544 is an abundant number, since it is smaller than the sum of its proper divisors (153017256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68339544 is a wasteful number, since it uses less digits than its factorization.
68339544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154 (or 137 counting only the distinct ones).
The product of its digits is 311040, while the sum is 42.
The square root of 68339544 is about 8266.7734939334. The cubic root of 68339544 is about 408.8437460446.
The spelling of 68339544 in words is "sixty-eight million, three hundred thirty-nine thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •