Base | Representation |
---|---|
bin | 1000001011011… |
… | …11110111100000 |
3 | 11210010000222022 |
4 | 10011233313200 |
5 | 120031200043 |
6 | 10450401012 |
7 | 1462136423 |
oct | 405576740 |
9 | 153100868 |
10 | 68615648 |
11 | 35805a52 |
12 | 1ab90168 |
13 | 112a569a |
14 | 91819ba |
15 | 6055868 |
hex | 416fde0 |
68615648 has 36 divisors (see below), whose sum is σ = 139976928. Its totient is φ = 33074880.
The previous prime is 68615641. The next prime is 68615671. The reversal of 68615648 is 84651686.
It is a super-3 number, since 3×686156483 (a number of 24 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 68615599 and 68615608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68615641) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 260765 + ... + 261027.
It is an arithmetic number, because the mean of its divisors is an integer number (3888248).
Almost surely, 268615648 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 68615648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69988464).
68615648 is an abundant number, since it is smaller than the sum of its proper divisors (71361280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68615648 is an equidigital number, since it uses as much as digits as its factorization.
68615648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567 (or 296 counting only the distinct ones).
The product of its digits is 276480, while the sum is 44.
The square root of 68615648 is about 8283.4562834604. The cubic root of 68615648 is about 409.3936068539.
The spelling of 68615648 in words is "sixty-eight million, six hundred fifteen thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •