Properties of the Number 5060

Five Thousand Sixty

Basics

Value: 5059 → 5060 → 5061

Parity: even

Prime: No

Previous Prime: 5059

Next Prime: 5077

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 11 × 23

Divisors: 1, 2, 4, 5, 10, 11, 20, 22, 23, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001111000100

Octal: 11704

Duodecimal: 2B18

Hexadecimal: 13c4

Square: 25603600

Square Root: 71.13367697511495

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

Numbers k such that k² divides 9^k - 1. A127101

Numbers k such that k² divides 7^k-1. A127107

Numbers k such that k² divides 3^k-1. A127103

Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges. A339560

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 6 as largest digit. A256633

Numbers k such that k² divides 13^k - 1. A128393

Numbers k such that k² divides 21^k-1. A128401

Numbers k such that k³ divides 3^k² - 1. A129211

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407

Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children. A94262