Base | Representation |
---|---|
bin | 10000001110000010001 |
3 | 1000000001012 |
4 | 2001300101 |
5 | 114001343 |
6 | 15220305 |
7 | 4342325 |
oct | 2016021 |
9 | 1000035 |
10 | 531473 |
11 | 333338 |
12 | 217695 |
13 | 157ba7 |
14 | db985 |
15 | a7718 |
hex | 81c11 |
531473 has 4 divisors (see below), whose sum is σ = 533988. Its totient is φ = 528960.
The previous prime is 531457. The next prime is 531481. The reversal of 531473 is 374135.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 374135 = 5 ⋅74827.
It can be written as a sum of positive squares in 2 ways, for example, as 208849 + 322624 = 457^2 + 568^2 .
It is a cyclic number.
It is not a de Polignac number, because 531473 - 24 = 531457 is a prime.
It is a d-powerful number, because it can be written as 5 + 3 + 42 + 1 + 7 + 312 .
It is a Duffinian number.
It is a Curzon number.
It is a plaindrome in base 11.
It is a nialpdrome in base 14.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 531473.
It is not an unprimeable number, because it can be changed into a prime (531173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 908 + ... + 1373.
It is an arithmetic number, because the mean of its divisors is an integer number (133497).
2531473 is an apocalyptic number.
It is an amenable number.
531473 is a deficient number, since it is larger than the sum of its proper divisors (2515).
531473 is a wasteful number, since it uses less digits than its factorization.
531473 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2514.
The product of its digits is 1260, while the sum is 23.
The square root of 531473 is about 729.0219475434. The cubic root of 531473 is about 81.0016257358.
The spelling of 531473 in words is "five hundred thirty-one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •