ℕ atory
Play Now

Properties of the Number 9495

Nine Thousand Four Hundred Ninety-Five

Basics

Value: 9494 → 9495 → 9496

Parity: odd

Prime: No

Previous Prime: 9491

Next Prime: 9497

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 2 × 5 × 211

Divisors: 1, 3, 5, 9, 15, 45, 211, 633, 1055, 1899

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10010100010111

Octal: 22427

Duodecimal: 55B3

Hexadecimal: 2517

Square: 90155025

Square Root: 97.44229061347029

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 degree-n permutations of order exactly 2. A1189
Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k. A80510
Triangle read by rows: T(n,k) is the number of permutations of n elements that have the longest cycle length k. A126074
T(n,k)=Number of length n+1 0..k arrays with the sum of the minimum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250419
T(n,k)=Number of length n+1 0..k arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250646
A partition product of Stirling1 type [parameter k = 1] with biggest-part statistic (triangle read by rows). A157391
Number T(n,k) of standard Young tableaux of n cells and height >= k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A182222
Partition the concatenation 1234567... of natural numbers into successive strings which are multiples of 3 all different and > 3. (0 never taken as the most significant digit.) A77296
Number of standard Young tableaux of n cells and height <= 9. A212915
Regular triangle read by rows where T(n,k) is the number of labeled simple graphs on n vertices where all non-isolated vertices have degree k. A319729