Base | Representation |
---|---|
bin | 11010010001000… |
… | …000000000000000 |
3 | 1010201012001110021 |
4 | 122101000000000 |
5 | 1400302222224 |
6 | 111420543224 |
7 | 13630403611 |
oct | 3221000000 |
9 | 1121161407 |
10 | 440664064 |
11 | 20681a485 |
12 | 1036b1b14 |
13 | 703ab489 |
14 | 4274bc08 |
15 | 28a471e4 |
hex | 1a440000 |
440664064 has 57 divisors (see below), whose sum is σ = 903346501. Its totient is φ = 214958080.
The previous prime is 440664053. The next prime is 440664067. The reversal of 440664064 is 460466044.
The square root of 440664064 is 20992.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 21233664 + 419430400 = 4608^2 + 20480^2 .
It is a Duffinian number.
It is a nialpdrome in base 8.
It is not an unprimeable number, because it can be changed into a prime (440664067) 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 2 ways as a sum of consecutive naturals, for example, 10747884 + ... + 10747924.
Almost surely, 2440664064 is an apocalyptic number.
440664064 is the 20992-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 440664064
440664064 is an abundant number, since it is smaller than the sum of its proper divisors (462682437).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
440664064 is an frugal number, since it uses more digits than its factorization.
440664064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118 (or 43 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 34.
The cubic root of 440664064 is about 760.9729367599.
The spelling of 440664064 in words is "four hundred forty million, six hundred sixty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •