Properties of the Number 5385

Five Thousand Three Hundred Eighty-Five

Basics

Value: 5384 → 5385 → 5386

Parity: odd

Prime: No

Previous Prime: 5381

Next Prime: 5387

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 359

Divisors: 1, 3, 5, 15, 359, 1077, 1795, 5385

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010100001001

Octal: 12411

Duodecimal: 3149

Hexadecimal: 1509

Square: 28998225

Square Root: 73.38255923582933

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Arithmetic derivative of the primorial base exp-function: a(n) = A003415(A276086(n)). A327860

T(n,k)=Number of (n+4)X(k+4) 0..1 matrices with each 5X5 subblock idempotent. A224690

a(n) = ∑_{k=0..floor(3·n/5)} binomial(k,3·n-5·k). A392271

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 1 or 3 king-move neighboring 1s. A296651

a(n) is the largest term encountered on the path to 0 when iterating the map x -> x', and starting from x = A351255(n). Here x' means the arithmetic derivative of x, A003415. A351261

Number of (unordered) triples of integers from [1,n] with no common factors between pairs. A15617

Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219

Triangle of 4-Eulerian numbers. A144698

Numbers with no prime index dividing all the other prime indices, but with a prime index divisible by all the other prime indices. A343339

Odd numbers k for which gcd(k, A003961(k)) = gcd(σ(k), A003961(k)) > 1, where A003961(n) is fully multiplicative with a(prime(k)) = prime(k+1), and σ is the sum of divisors function. A349176