Properties of the Number 36954

Thirty-Six Thousand Nine Hundred Fifty-Four

Basics

Value: 36953 → 36954 → 36955

Parity: even

Prime: No

Previous Prime: 36947

Next Prime: 36973

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 2053

Divisors: 1, 2, 3, 6, 9, 18, 2053, 4106, 6159, 12318

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001000001011010

Octal: 110132

Duodecimal: 19476

Hexadecimal: 905a

Square: 1365598116

Square Root: 192.23423212320952

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

Number of ways to arrange n non-attacking kings on an n X n board, with 2 sides identified to form a cylinder, with 1 in each row and column. A2493

Number of partitions p of n such that the number of parts having multiplicity 1 is a part or max(p) - min(p) is a part. A241451

Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] where adjacent values cannot be consecutive modulo n. A338838

Number of irreducible representations of symmetric group S_n for which every matrix has determinant 1. A45923

a(n) = n * (6·n² + 6·n + 1). A94421

Number of isomorphism classes of simply embedded (i.e., loop-free and without parallel edges bounding a disk) quadrangulations of RP² of minimum degree 3 with n nodes and n-1 faces. A187013

Number of nX7 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards. A280858

Primes with digits in {0,1,2} taken as base 3 and converted to base 10. A36954

Consider 1-D random walk with jumps up to the fourth neighbor, i.e., set of possible jumps is {-4,-3,-2,-1,+1,+2,+3,+4}. Sequence gives number of paths of length n ending at origin. A181072