Properties of the Number 10611

Ten Thousand Six Hundred Eleven

Basics

Value: 10610 → 10611 → 10612

Parity: odd

Prime: No

Previous Prime: 10607

Next Prime: 10613

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 131

Divisors: 1, 3, 9, 27, 81, 131, 393, 1179, 3537, 10611

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100101110011

Octal: 24563

Duodecimal: 6183

Hexadecimal: 2973

Square: 112593321

Square Root: 103.00970828033637

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

3 times 12-gonal (or dodecagonal) numbers: a(n) = 3·n*(5·n-4). A153448

Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i·j*k| <= n and gcd(i,j,k) <= 1. A226357

The second of the three sequences associated with the polynomial x³ - 2. A52102

p² + 2 where p is a prime. A61725

Minimal k > n such that (4·k+3·n) * (4·n+3·k) is a square. A83752

a(n) = (6 + 10·n + 5·n² + n³)/2. A164845

Number of n-bead necklaces labeled with numbers 1..7 not allowing reversal, with no adjacent beads differing by more than 1. A208776

a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence. A274328

Odd composite integers m such that A006190(2·m-J(m,13)) == 1 (mod m), where J(m,13) is the Jacobi symbol. A340119

a(n) = ∑_{k=0..floor(n/3)} 3^k * 2^n-3·k * binomial(k,n-3·k)². A387482