Base | Representation |
---|---|
bin | 1000000110011… |
… | …11110100010000 |
3 | 11201212201201000 |
4 | 10003033310100 |
5 | 114344210310 |
6 | 10424342000 |
7 | 1453436226 |
oct | 403176420 |
9 | 151781630 |
10 | 67960080 |
11 | 353a8461 |
12 | 1a914900 |
13 | 11106186 |
14 | 9050b16 |
15 | 5e764c0 |
hex | 40cfd10 |
67960080 has 160 divisors (see below), whose sum is σ = 237841920. Its totient is φ = 17832960.
The previous prime is 67960069. The next prime is 67960097. The reversal of 67960080 is 8006976.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 157465 + ... + 157895.
It is an arithmetic number, because the mean of its divisors is an integer number (1486512).
Almost surely, 267960080 is an apocalyptic number.
67960080 is a gapful number since it is divisible by the number (60) 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 67960080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118920960).
67960080 is an abundant number, since it is smaller than the sum of its proper divisors (169881840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67960080 is a wasteful number, since it uses less digits than its factorization.
67960080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526 (or 514 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 67960080 is about 8243.7903903484. The cubic root of 67960080 is about 408.0856221686.
The spelling of 67960080 in words is "sixty-seven million, nine hundred sixty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •