Search a number
BaseRepresentation
bin1010011110001
321100120
41103301
5132421
640453
721426
oct12361
97316
105361
114034
123129
132595
141d4d
1518c6
hex14f1

5361 has 4 divisors (see below), whose sum is σ = 7152. Its totient is φ = 3572.

The previous prime is 5351. The next prime is 5381. The reversal of 5361 is 1635.

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 a cyclic number.

It is not a de Polignac number, because 5361 - 26 = 5297 is a prime.

It is a D-number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 5361.

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

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

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

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

25361 is an apocalyptic number.

It is an amenable number.

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

5361 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1790.

The product of its digits is 90, while the sum is 15.

The square root of 5361 is about 73.2188500319. The cubic root of 5361 is about 17.5017685288.

Adding to 5361 its reverse (1635), we get a palindrome (6996).

The spelling of 5361 in words is "five thousand, three hundred sixty-one".

Divisors: 1 3 1787 5361