Base | Representation |
---|---|
bin | 1000000011000… |
… | …10111111011000 |
3 | 11201001002020200 |
4 | 10001202333120 |
5 | 114240424303 |
6 | 10411022200 |
7 | 1446601530 |
oct | 401427730 |
9 | 151032220 |
10 | 67514328 |
11 | 35123572 |
12 | 1a73a960 |
13 | 10cab30b |
14 | 8d764c0 |
15 | 5dd93a3 |
hex | 4062fd8 |
67514328 has 96 divisors (see below), whose sum is σ = 211280160. Its totient is φ = 19077120.
The previous prime is 67514299. The next prime is 67514329. The reversal of 67514328 is 82341576.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 67514292 and 67514301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67514329) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48198 + ... + 49578.
It is an arithmetic number, because the mean of its divisors is an integer number (2200835).
Almost surely, 267514328 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 67514328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105640080).
67514328 is an abundant number, since it is smaller than the sum of its proper divisors (143765832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67514328 is a wasteful number, since it uses less digits than its factorization.
67514328 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1497 (or 1490 counting only the distinct ones).
The product of its digits is 40320, while the sum is 36.
The square root of 67514328 is about 8216.7102906212. The cubic root of 67514328 is about 407.1914494700.
The spelling of 67514328 in words is "sixty-seven million, five hundred fourteen thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.047 sec. • engine limits •