• 675 can be written using four 4's:
The previous prime is 673. The next prime is 677. The reversal of 675 is 576.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
675 is nontrivially palindromic in base 14.
675 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 262-1.
It is an interprime number because it is at equal distance from previous prime (673) and next prime (677).
It is not a de Polignac number, because 675 - 21 = 673 is a prime.
675 is an undulating number in base 14.
It is a plaindrome in base 13.
It is a nialpdrome in base 3, base 9 and base 15.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 675.
It is not an unprimeable number, because it can be changed into a prime (673) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 133 + ... + 137.
675 is a deficient number, since it is larger than the sum of its proper divisors (565).
675 is a wasteful number, since it uses less digits than its factorization.
675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19 (or 8 counting only the distinct ones).
The product of its digits is 210, while the sum is 18.
The square root of 675 is about 25.9807621135. The cubic root of 675 is about 8.7720532146.
Subtracting from 675 its product of digits (210), we obtain a triangular number (465 = T30).
Subtracting from 675 its reverse (576), we obtain a palindrome (99).
It can be divided in two parts, 6 and 75, that added together give a 4-th power (81 = 34).
The spelling of 675 in words is "six hundred seventy-five", and thus it is an aban number and an oban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •