Properties of the Number 66096

Sixty-Six Thousand Ninety-Six

Basics

Value: 66095 → 66096 → 66097

Parity: even

Prime: No

Previous Prime: 66089

Next Prime: 66103

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ⁵ × 17

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000001000110000

Octal: 201060

Duodecimal: 32300

Hexadecimal: 10230

Square: 4368681216

Square Root: 257.0914234275426

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

Numbers with an even number of prime factors (counted with multiplicity) that can be factored into squarefree semiprimes (A320911) but cannot be factored into distinct semiprimes (A320892). A320893

Number a(n,k) of positions (cyclic permutations) of circular permutations of [n] with exactly k (unspecified) increasing or decreasing modular runs (3-sequences), with clockwise and counterclockwise traversals counted as distinct; triangle a(n,k) read by rows, 0<=k<=n. A235943

Number of positions (cyclic permutations) of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals counted as distinct. A235942

Numbers with prime factorization pq^4r^5. A190468

Base 5 digital convolution sequence. A33642

a(n) = 6ⁿ*(n² - n + 72)/72. A81912

Cyclops numbers with circular digits {0,6,8,9}. A274765

a(0) = 1; a(n) = n^n-1(3n-1)/2 (n>0). A81918

Number of (n+2) X (2+2) 0..1 arrays with every 2 X 2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically. A253504

Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k. A94785