ℕ atory
Play Now

Properties of the Number 26232

Twenty-Six Thousand Two Hundred Thirty-Two

Basics

Value: 26231 → 26232 → 26233

Parity: even

Prime: No

Previous Prime: 26227

Next Prime: 26237

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 3 × 3 × 1093

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1093, 2186

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110011001111000

Octal: 63170

Duodecimal: 13220

Hexadecimal: 6678

Square: 688117824

Square Root: 161.9629587282228

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

Sum T(n,k) of the k-th entries in all cycles of all permutations of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A285793
Exponents k where A000120(3k) - A070939(3k)/2 reaches a new minimum. A372097
Period of the sequence of the digital roots of Fibonacci n-step numbers. A210456
Number of partitions p of 2n+1 such that n - (number of parts of p) is a part of p. A238742
Numbers k such that the ring of integers of Q(21/k) is not Z[21/k]. A342390
a(n) = 729·n2 - 2·n. A158394
a(0) = 1, and for n >= 1, a(n) is either the largest divisor of a(n-1) not already present in the sequence, or (if all divisors already used), a(n-1) * {the least prime p such that p does not divide a(n-1) and p·a(n-1) is not already present}. A303762
a(0) = 0, a(n+1) is either the largest number obtained from a(n) by toggling a single 1-bit off (to 0) if no such number is yet in the sequence, otherwise the least number not yet in sequence that can be obtained from a(n) by toggling a single 0-bit on (to 1). In both cases the bit to be toggled is the rightmost possible that results yet an unencountered number. A303769
Table T(n,k) read by downward antidiagonals: period of n-step Fibonacci numbers mod k, n >= 1, k >= 1. A351889
a(n) = (1/3)*(s(n) + 1), where s = A026231. A26232