Base | Representation |
---|---|
bin | 11111101010101… |
… | …110001110110101 |
3 | 1101000201111010120 |
4 | 133222232032311 |
5 | 2042002334414 |
6 | 124415242153 |
7 | 16110626334 |
oct | 3752561665 |
9 | 1330644116 |
10 | 531293109 |
11 | 2529a0416 |
12 | 129b19359 |
13 | 860c0829 |
14 | 507bdd1b |
15 | 3199a2a9 |
hex | 1faae3b5 |
531293109 has 8 divisors (see below), whose sum is σ = 708583392. Its totient is φ = 354099120.
The previous prime is 531293107. The next prime is 531293111. The reversal of 531293109 is 901392135.
It is an interprime number because it is at equal distance from previous prime (531293107) and next prime (531293111).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 531293109 - 21 = 531293107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 531293109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (531293107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10027 + ... + 34104.
It is an arithmetic number, because the mean of its divisors is an integer number (88572924).
Almost surely, 2531293109 is an apocalyptic number.
It is an amenable number.
531293109 is a deficient number, since it is larger than the sum of its proper divisors (177290283).
531293109 is a wasteful number, since it uses less digits than its factorization.
531293109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48147.
The product of its (nonzero) digits is 7290, while the sum is 33.
The square root of 531293109 is about 23049.7962897723. The cubic root of 531293109 is about 809.9248566171.
The spelling of 531293109 in words is "five hundred thirty-one million, two hundred ninety-three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •