1301 has 2 divisors, whose sum is σ = 1302. Its totient is φ = 1300.
The previous prime is 1297. The next prime is 1303. The reversal of 1301 is 1031.
1301 is nontrivially palindromic in base 16.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 676 + 625 = 26^2 + 25^2 .
It is an emirp because it is prime and its reverse (1031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1301 - 22 = 1297 is a prime.
Together with 1303, it forms a pair of twin primes.
It is a Chen prime.
It is a fibodiv number, since the Fibonacci-like sequence with seeds 13 and 1 contains 1301 itself.
1301 is an undulating number in base 16.
It is equal to p212 and since 1301 and 212 have the same sum of digits, it is a Honaker prime.
It is a plaindrome in base 14 and base 15.
It is a nialpdrome in base 11.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1303) 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 as a sum of consecutive naturals, namely, 650 + 651.
It is an arithmetic number, because the mean of its divisors is an integer number (651).
21301 is an apocalyptic number.
1301 is the 26-th centered square number.
It is an amenable number.
1301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301 is an equidigital number, since it uses as much as digits as its factorization.
1301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 5.
The square root of 1301 is about 36.0693775937. The cubic root of 1301 is about 10.9167265567.
Adding to 1301 its reverse (1031), we get a palindrome (2332).
It can be divided in two parts, 130 and 1, that added together give a palindrome (131).
The spelling of 1301 in words is "one thousand, three hundred one", and thus it is an iban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •