Properties of the Number 10763

Ten Thousand Seven Hundred Sixty-Three

Basics

Value: 10762 → 10763 → 10764

Parity: odd

Prime: No

Previous Prime: 10753

Next Prime: 10771

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 47 × 229

Divisors: 1, 47, 229, 10763

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101000001011

Octal: 25013

Duodecimal: 628B

Hexadecimal: 2a0b

Square: 115842169

Square Root: 103.74487939170781

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

Minimal exponents m such that the fractional part of (101/100)^m obtains a maximum (when starting with m=1). A153671

Numbers k such that the fractional part of (101/100)^k is greater than 1-(1/k). A153672

Integer part of square root of n⁵ = A000584(n). A155013

Number of rooted trees on n nodes with strictly thinning limbs. A298304

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294546

Composite numbers k coprime to 8 such that k divides Pell(k - Kronecker(8,k)), Pell = A000129. A327651

Number of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value <= 4. A262129

Composite numbers k such that Pell(k) == 1 (mod k). A319042

Smallest solution m to (n+1)*φ(m) = n*σ(m), or -1 if no solution exists. A65824

a(n) = 4·n² - n - 1. A185950