Properties of the Number 94828

Ninety-Four Thousand Eight Hundred Twenty-Eight

Basics

Value: 94827 → 94828 → 94829

Parity: even

Prime: No

Previous Prime: 94823

Next Prime: 94837

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 151 × 157

Divisors: 1, 2, 4, 151, 157, 302, 314, 604, 628, 23707

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001001101100

Octal: 271154

Duodecimal: 46A64

Hexadecimal: 1726c

Square: 8992349584

Square Root: 307.9415528960001

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

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

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

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

Number of embedded coalitions in an n-person game. A138378

Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most nine elements. A276725

Mirror image of the Bell triangle A011971, which is also called the Pierce triangle or Aitken's array. A123346

Sequence formed by reading rows of triangle defined in A011971. A11972

Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the last block is the singleton {k}, 1<=k<=n; the blocks are ordered with increasing least elements. A108458