Base | Representation |
---|---|
bin | 10000001101000101111 |
3 | 222222101100 |
4 | 2001220233 |
5 | 113442431 |
6 | 15214143 |
7 | 4341036 |
oct | 2015057 |
9 | 888340 |
10 | 530991 |
11 | 332a3a |
12 | 217353 |
13 | 1578c6 |
14 | db71d |
15 | a74e6 |
hex | 81a2f |
530991 has 12 divisors (see below), whose sum is σ = 786240. Its totient is φ = 345120.
The previous prime is 530989. The next prime is 531017. The reversal of 530991 is 199035.
It is not a de Polignac number, because 530991 - 21 = 530989 is a prime.
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530911) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 351 + ... + 1088.
It is an arithmetic number, because the mean of its divisors is an integer number (65520).
530991 is a Friedman number, since it can be written as (3^(9+1)-50)*9, using all its digits and the basic arithmetic operations.
2530991 is an apocalyptic number.
530991 is a deficient number, since it is larger than the sum of its proper divisors (255249).
530991 is a wasteful number, since it uses less digits than its factorization.
530991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1486 (or 1483 counting only the distinct ones).
The product of its (nonzero) digits is 1215, while the sum is 27.
The square root of 530991 is about 728.6912926610. The cubic root of 530991 is about 80.9771311755.
It can be divided in two parts, 530 and 991, that added together give a square (1521 = 392).
The spelling of 530991 in words is "five hundred thirty thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •