Properties of the Number 5383

Five Thousand Three Hundred Eighty-Three

Basics

Value: 5382 → 5383 → 5384

Parity: odd

Prime: No

Previous Prime: 5381

Next Prime: 5387

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 × 769

Divisors: 1, 7, 769, 5383

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010100000111

Octal: 12407

Duodecimal: 3147

Hexadecimal: 1507

Square: 28976689

Square Root: 73.36893075410055

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

a(n) = floor(n(n+2)(2n+1)/8). A2717

Number of partitions of n having depth 1; see Comments. A237685

Number of maximal subsets of {1..n} containing n such that every subset has a different sum. A325867

Odd composite numbers k such that A053575(k) [the odd part of φ] divides k-1. A339880

a(0) = 0; a(1)=1; for n>1, a(n) = least positive integer m not among a(1),...,a(n-1) such that |m-a(n-1)| > |a(n-1)-a(n-2)|. A78783

Number of balanced reduced multisystems whose atoms cover an initial interval of positive integers with multiplicities equal to the prime indices of n. A318846

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A326105

T(n,k) = Number of n X k 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X (k+1) binary array having two adjacent 1's and two adjacent 0's, with rows and columns of the latter in lexicographically nondecreasing order. A227333

Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part and the number of numbers having multiplicity > 1 is a part. A241414

Number of surviving (but not bifurcating) odd nodes at generation n in the binary tree of persistently squarefree numbers (see A293230). A293519