Base | Representation |
---|---|
bin | 1110100000010000000 |
3 | 220010221101 |
4 | 1310002000 |
5 | 110202024 |
6 | 14104144 |
7 | 4016416 |
oct | 1640200 |
9 | 803841 |
10 | 475264 |
11 | 2a5089 |
12 | 1ab054 |
13 | 13842a |
14 | c52b6 |
15 | 95c44 |
hex | 74080 |
475264 has 32 divisors (see below), whose sum is σ = 979200. Its totient is φ = 229632.
The previous prime is 475243. The next prime is 475271. The reversal of 475264 is 462574.
475264 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
Its product of digits (6720) is a multiple of the sum of its prime factors (140).
It is a congruent number.
It is an unprimeable number.
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, 5977 + ... + 6055.
It is an arithmetic number, because the mean of its divisors is an integer number (30600).
2475264 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 475264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (489600).
475264 is an abundant number, since it is smaller than the sum of its proper divisors (503936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
475264 is an equidigital number, since it uses as much as digits as its factorization.
475264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 128 counting only the distinct ones).
The product of its digits is 6720, while the sum is 28.
The square root of 475264 is about 689.3939367299. The cubic root of 475264 is about 78.0389899304.
The spelling of 475264 in words is "four hundred seventy-five thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •