3073 has 4 divisors (see below), whose sum is σ = 3520. Its totient is φ = 2628.

The previous prime is 3067. The next prime is 3079. The reversal of 3073 is 3703.

Adding to 3073 its product of nonzero digits (63), we get a square (3136 = 56^{2}).

Adding to 3073 its reverse (3703), we get a palindrome (6776).

Subtracting 3073 from its reverse (3703), we obtain a triangular number (630 = T_{35}).

3073 is nontrivially palindromic in base 15.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is an interprime number because it is at equal distance from previous prime (3067) and next prime (3079).

It is a cyclic number.

It is not a de Polignac number, because 3073 - 2^{5} = 3041 is a prime.

It is a Duffinian number.

3073 is an undulating number in base 15.

3073 is a lucky number.

It is a plaindrome in base 11.

It is not an unprimeable number, because it can be changed into a prime (3079) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (3) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213 + ... + 226.

It is an arithmetic number, because the mean of its divisors is an integer number (880).

It is a Proth number, since it is equal to 3 ⋅ 2^{10} + 1 and 3 < 2^{10}.

2^{3073} is an apocalyptic number.

It is an amenable number.

3073 is a deficient number, since it is larger than the sum of its proper divisors (447).

3073 is an equidigital number, since it uses as much as digits as its factorization.

3073 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 446.

The product of its (nonzero) digits is 63, while the sum is 13.

The square root of 3073 is about 55.4346462061. The cubic root of 3073 is about 14.5385419332.

The spelling of 3073 in words is "three thousand, seventy-three", and thus it is an iban number.

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •