Base | Representation |
---|---|
bin | 1000000110100… |
… | …11000101100000 |
3 | 11201220102002000 |
4 | 10003103011200 |
5 | 114400122342 |
6 | 10424524000 |
7 | 1453523250 |
oct | 403230540 |
9 | 151812060 |
10 | 67973472 |
11 | 35407526 |
12 | 1a920600 |
13 | 1110c2b8 |
14 | 9055960 |
15 | 5e7a44c |
hex | 40d3160 |
67973472 has 96 divisors (see below), whose sum is σ = 226598400. Its totient is φ = 19419264.
The previous prime is 67973461. The next prime is 67973473. The reversal of 67973472 is 27437976.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67973473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429 + ... + 11667.
It is an arithmetic number, because the mean of its divisors is an integer number (2360400).
Almost surely, 267973472 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 67973472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113299200).
67973472 is an abundant number, since it is smaller than the sum of its proper divisors (158624928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
67973472 is a wasteful number, since it uses less digits than its factorization.
67973472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11265 (or 11251 counting only the distinct ones).
The product of its digits is 444528, while the sum is 45.
The square root of 67973472 is about 8244.6025980638. The cubic root of 67973472 is about 408.1124257653.
The spelling of 67973472 in words is "sixty-seven million, nine hundred seventy-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •