Properties of the Number 3263

Three Thousand Two Hundred Sixty-Three

Basics

Value: 3262 → 3263 → 3264

Parity: odd

Prime: No

Previous Prime: 3259

Next Prime: 3271

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 13 × 251

Divisors: 1, 13, 251, 3263

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110010111111

Octal: 6277

Duodecimal: 1A7B

Hexadecimal: cbf

Square: 10647169

Square Root: 57.12267500739089

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

2-Bell numbers: a(n) = number of partitions of [n+1] with a distinguished block. A5493

Number of partitions of n into at least two distinct parts. A111133

Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1). A11971

Numbers m such that m and m+1 are consecutive factorial base Niven numbers (A118363). A328205

Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have been distinguished. A49020

a(n) = (-4·n³ + 27·n² - 20·n + 3)/3. A161711

Expansion of 1/(1 - x + 4·x²). A106853

Difference array of Bell numbers A000110 read by antidiagonals. A106436

Number T(n,k) of blocks of size >= k in all set partitions of [n], assuming that every set partition contains one block of size zero; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A283424

Array, read by antidiagonals, where A(n,k) = exp(-1)*∑_i>=0 (i+k)ⁿ/i!. A108087