Properties of the Number 35934

Thirty-Five Thousand Nine Hundred Thirty-Four

Basics

Value: 35933 → 35934 → 35935

Parity: even

Prime: No

Previous Prime: 35933

Next Prime: 35951

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 53 × 113

Divisors: 1, 2, 3, 6, 53, 106, 113, 159, 226, 318

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110001011110

Octal: 106136

Duodecimal: 18966

Hexadecimal: 8c5e

Square: 1291252356

Square Root: 189.56265454988755

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

a(n) is the smallest number k larger than a(n-1) such that n·d(k)*sopf(k)=σ(k), where d is the number of divisors (A000005) and sopf the sum of prime factors without repetition (A008472). A134382

Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101. A261110

Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101. A261111

Number of regions in a regular n-gon with all diagonals drawn whose edges all have a different number of facing edges. A350718

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101. A261113

Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k". A35934