Base | Representation |
---|---|
bin | 10001101100111011010000 |
3 | 22201202112001 |
4 | 101230323100 |
5 | 2141443324 |
6 | 243243344 |
7 | 54305023 |
oct | 21547320 |
9 | 8652461 |
10 | 4640464 |
11 | 268a4a4 |
12 | 1679554 |
13 | c6624a |
14 | 88b1ba |
15 | 619e44 |
hex | 46ced0 |
4640464 has 40 divisors (see below), whose sum is σ = 9497160. Its totient is φ = 2193408.
The previous prime is 4640443. The next prime is 4640477.
4640464 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 1000000 + 3640464 = 1000^2 + 1908^2 .
It is a super-2 number, since 2×46404642 = 43067812270592, which contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 33804 + ... + 33940.
It is an arithmetic number, because the mean of its divisors is an integer number (237429).
Almost surely, 24640464 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 4640464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4748580).
4640464 is an abundant number, since it is smaller than the sum of its proper divisors (4856696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4640464 is a wasteful number, since it uses less digits than its factorization.
4640464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247 (or 241 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 28.
The square root of 4640464 is about 2154.1736234575. The cubic root of 4640464 is about 166.7965778233.
The spelling of 4640464 in words is "four million, six hundred forty thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •