Properties of the Number 4260

Four Thousand Two Hundred Sixty

Basics

Value: 4259 → 4260 → 4261

Parity: even

Prime: No

Previous Prime: 4259

Next Prime: 4261

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 × 71

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010100100

Octal: 10244

Duodecimal: 2570

Hexadecimal: 10a4

Square: 18147600

Square Root: 65.26867548832288

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

Number of inseparable partitions of n; see Comments. A325535

Number T(n,k) of permutations p of [n] such that the up-down signature of 0,p has nonnegative partial sums with a maximal value of k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A258829

Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3. A64238

Total number of left truncatable primes (without zeros) in base n. A76623

5 times pentagonal numbers: 5·n*(3·n-1)/2. A152734

Table T(k, n) of smallest bases b > 1 such that p = prime(n) satisfies b^p-1 == 1 (mod p^k), read by antidiagonals. A257833

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2. A180834

Numbers k such that k-1, k+1 and k²+1 are prime numbers. A70155

Number of compositions of n with equal circular differences up to sign. A325558

Primitive elements of A337386: numbers k for which σ(A003961(k)) >= 2·A003961(k), but none of the proper divisors of k satisfy the same condition. A337479