Properties of the Number 10268

Ten Thousand Two Hundred Sixty-Eight

Basics

Value: 10267 → 10268 → 10269

Parity: even

Prime: No

Previous Prime: 10267

Next Prime: 10271

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 17 × 151

Divisors: 1, 2, 4, 17, 34, 68, 151, 302, 604, 2567

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10100000011100

Octal: 24034

Duodecimal: 5B38

Hexadecimal: 281c

Square: 105431824

Square Root: 101.33114032714721

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 balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing). A19298

Number of subset-sums of strict integer partitions of n. A365925

T(n,k)=Number of nXk 0..1 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..1 order. A222541

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101. A261113

a(n) = least 2k such that p is the least prime in a Goldbach partition of 2k, where p = prime(n). A25017

Partial sums of A365414. A365444

Records in A118514. A118515

Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2). A237568

Expansion of e.g.f. (1/x) * Series_Reversion( x/(1 + log(1-x)²) ). A392852

Number of distinct angles in all integer-sided triangles with all sides <= n. A123325