Base | Representation |
---|---|
bin | 1000000010100… |
… | …01000001000000 |
3 | 11200220100020212 |
4 | 10001101001000 |
5 | 114231100304 |
6 | 10405253252 |
7 | 1446144062 |
oct | 401210100 |
9 | 150810225 |
10 | 67440704 |
11 | 35083221 |
12 | 1a704228 |
13 | 10c83956 |
14 | 8d57732 |
15 | 5dc266e |
hex | 4051040 |
67440704 has 28 divisors (see below), whose sum is σ = 134128764. Its totient is φ = 33644544.
The previous prime is 67440701. The next prime is 67440707. The reversal of 67440704 is 40704476.
It is an interprime number because it is at equal distance from previous prime (67440701) and next prime (67440707).
It can be written as a sum of positive squares in 2 ways, for example, as 37847104 + 29593600 = 6152^2 + 5440^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (67440701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37064 + ... + 38840.
It is an arithmetic number, because the mean of its divisors is an integer number (4790313).
Almost surely, 267440704 is an apocalyptic number.
67440704 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
67440704 is a deficient number, since it is larger than the sum of its proper divisors (66688060).
67440704 is a wasteful number, since it uses less digits than its factorization.
67440704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2382 (or 2372 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 32.
The square root of 67440704 is about 8212.2289300774. The cubic root of 67440704 is about 407.0433822962.
The spelling of 67440704 in words is "sixty-seven million, four hundred forty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •