Base | Representation |
---|---|
bin | 1000001101001… |
… | …01110011000100 |
3 | 11210112020222210 |
4 | 10012211303010 |
5 | 120110232143 |
6 | 10455223420 |
7 | 1464046434 |
oct | 406456304 |
9 | 153466883 |
10 | 68836548 |
11 | 35946a10 |
12 | 1b077b70 |
13 | 113520b1 |
14 | 91dc2c4 |
15 | 609b033 |
hex | 41a5cc4 |
68836548 has 96 divisors (see below), whose sum is σ = 181988352. Its totient is φ = 20073600.
The previous prime is 68836511. The next prime is 68836561. The reversal of 68836548 is 84563886.
It is a junction number, because it is equal to n+sod(n) for n = 68836497 and 68836506.
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 31 ways as a sum of consecutive naturals, for example, 668265 + ... + 668367.
It is an arithmetic number, because the mean of its divisors is an integer number (1895712).
Almost surely, 268836548 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 68836548, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90994176).
68836548 is an abundant number, since it is smaller than the sum of its proper divisors (113151804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68836548 is a wasteful number, since it uses less digits than its factorization.
68836548 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265 (or 263 counting only the distinct ones).
The product of its digits is 1105920, while the sum is 48.
The square root of 68836548 is about 8296.7793751552. The cubic root of 68836548 is about 409.8324677419.
It can be divided in two parts, 6883 and 6548, that added together give a palindrome (13431).
The spelling of 68836548 in words is "sixty-eight million, eight hundred thirty-six thousand, five hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •