Properties of the Number 35952

Thirty-Five Thousand Nine Hundred Fifty-Two

Basics

Value: 35951 → 35952 → 35953

Parity: even

Prime: No

Previous Prime: 35951

Next Prime: 35963

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 7 × 107

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110001110000

Octal: 106160

Duodecimal: 18980

Hexadecimal: 8c70

Square: 1292546304

Square Root: 189.6101263118613

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

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically. A207845

Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, up. A177527

Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically. A207841

Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 1 1 vertically. A207850

a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972). A338474

a(n) = ∑_d∣n d^τ(d - 1). A348349

Number of partitions of n into parts not of the form 13k, 13k+4 or 13k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 5 are greater than 1. A35952