Properties of the Number 46836

Forty-Six Thousand Eight Hundred Thirty-Six

Basics

Value: 46835 → 46836 → 46837

Parity: even

Prime: No

Previous Prime: 46831

Next Prime: 46853

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 1301

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 1301

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011011011110100

Octal: 133364

Duodecimal: 23130

Hexadecimal: b6f4

Square: 2193610896

Square Root: 216.4162655624572

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

Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the edges of a regular n-dimensional simplex using up to k colors. A327086

Number of achiral colorings of the edges (or triangular faces) of a regular 4-dimensional simplex with n available colors. A331353

Array read by descending antidiagonals: T(n,k) is the number of achiral colorings of the triangular faces of a regular n-dimensional simplex using k or fewer colors. A337886

Number of character table entries of the symmetric group S_n which are > 0. A51749

a(n) = 9·n³ - 18·n² + 10·n. A86605

Numbers k such that Bernoulli number B_k has denominator 1919190. A295595

a(n) is the least k such that A056619(k) = prime(n). A280015

Take apart the sides of each of the integer-sided scalene triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way. A308234

Number of cyclic edge cuts in the n-prism graph. A378311

Number of cyclic edge cuts in the n-Moebius ladder graph. A378312