Properties of the Number 10971

Ten Thousand Nine Hundred Seventy-One

Basics

Value: 10970 → 10971 → 10972

Parity: odd

Prime: No

Previous Prime: 10957

Next Prime: 10973

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 23 × 53

Divisors: 1, 3, 9, 23, 53, 69, 159, 207, 477, 1219

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101011011011

Octal: 25333

Duodecimal: 6423

Hexadecimal: 2adb

Square: 120362841

Square Root: 104.74254150057655

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(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations. A23109

In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1. A6877

Expansion of 1/(1+x+2·x²+x³). A77979

Expansion of 1/(1 + 2·x + 3·x² + x³). A127896

Index where prime(n) appears as a term in A379248. A379290

Expansion of 1/(1-x+2·x²-x³) in powers of x. A77954

Expansion of ∏_k>=0 1/(1 - x^3·k+1)². A261616

In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1. A33958

n sets a record for the number of primes in {n, f(n), f(f(n)), ..., 1}, where f is the Collatz function defined by f(x) = x/2 if·is even; f(x) = 3x + 1 if·is odd. A78373

Maximal number of right triangles in n turns of Pythagoras's snail. A137515