Base | Representation |
---|---|
bin | 1110010100110… |
… | …0011010010000 |
3 | 11012001110202011 |
4 | 3211030122100 |
5 | 110340104213 |
6 | 5543432304 |
7 | 1326454423 |
oct | 345143220 |
9 | 135043664 |
10 | 60081808 |
11 | 30a07396 |
12 | 18155694 |
13 | c5a8287 |
14 | 7d9d9ba |
15 | 541c03d |
hex | 394c690 |
60081808 has 20 divisors (see below), whose sum is σ = 123256620. Its totient is φ = 28273664.
The previous prime is 60081803. The next prime is 60081817. The reversal of 60081808 is 80818006.
It can be written as a sum of positive squares in 2 ways, for example, as 19784704 + 40297104 = 4448^2 + 6348^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 60081808.
It is not an unprimeable number, because it can be changed into a prime (60081803) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 110173 + ... + 110716.
It is an arithmetic number, because the mean of its divisors is an integer number (6162831).
Almost surely, 260081808 is an apocalyptic number.
60081808 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
60081808 is an abundant number, since it is smaller than the sum of its proper divisors (63174812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60081808 is a wasteful number, since it uses less digits than its factorization.
60081808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220914 (or 220908 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 31.
The square root of 60081808 is about 7751.2455773250. The cubic root of 60081808 is about 391.6646096970.
The spelling of 60081808 in words is "sixty million, eighty-one thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •