Base | Representation |
---|---|
bin | 1000001001011… |
… | …10000011011000 |
3 | 11202121100012000 |
4 | 10010232003120 |
5 | 114444033242 |
6 | 10440521000 |
7 | 1456634454 |
oct | 404560330 |
9 | 152540160 |
10 | 68346072 |
11 | 35641463 |
12 | 1aa80160 |
13 | 1120ca82 |
14 | 9111664 |
15 | 6000a4c |
hex | 412e0d8 |
68346072 has 128 divisors (see below), whose sum is σ = 200448000. Its totient is φ = 21548160.
The previous prime is 68346071. The next prime is 68346077. The reversal of 68346072 is 27064386.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68346071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 394978 + ... + 395150.
It is an arithmetic number, because the mean of its divisors is an integer number (1566000).
Almost surely, 268346072 is an apocalyptic number.
68346072 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 68346072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100224000).
68346072 is an abundant number, since it is smaller than the sum of its proper divisors (132101928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68346072 is a wasteful number, since it uses less digits than its factorization.
68346072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278 (or 268 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 68346072 is about 8267.1683181123. The cubic root of 68346072 is about 408.8567636273.
The spelling of 68346072 in words is "sixty-eight million, three hundred forty-six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •