Base | Representation |
---|---|
bin | 1000001100101… |
… | …11011000110000 |
3 | 11210102021000120 |
4 | 10012113120300 |
5 | 120101340040 |
6 | 10454050240 |
7 | 1463412360 |
oct | 406273060 |
9 | 153367016 |
10 | 68777520 |
11 | 35906629 |
12 | 1b049980 |
13 | 11331276 |
14 | 91c49a0 |
15 | 60887d0 |
hex | 4197630 |
68777520 has 80 divisors (see below), whose sum is σ = 243674880. Its totient is φ = 15720192.
The previous prime is 68777519. The next prime is 68777537. The reversal of 68777520 is 2577786.
It is a tau number, because it is divible by the number of its divisors (80).
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 15 ways as a sum of consecutive naturals, for example, 18790 + ... + 22149.
It is an arithmetic number, because the mean of its divisors is an integer number (3045936).
Almost surely, 268777520 is an apocalyptic number.
68777520 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
68777520 is an abundant number, since it is smaller than the sum of its proper divisors (174897360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68777520 is a wasteful number, since it uses less digits than its factorization.
68777520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40962 (or 40956 counting only the distinct ones).
The product of its (nonzero) digits is 164640, while the sum is 42.
The square root of 68777520 is about 8293.2213282897. The cubic root of 68777520 is about 409.7152891512.
The spelling of 68777520 in words is "sixty-eight million, seven hundred seventy-seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •