Properties of the Number 94905

Ninety-Four Thousand Nine Hundred Five

Basics

Value: 94904 → 94905 → 94906

Parity: odd

Prime: No

Previous Prime: 94903

Next Prime: 94907

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 19 × 37

Divisors: 1, 3, 5, 9, 15, 19, 27, 37, 45, 57

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10111001010111001

Octal: 271271

Duodecimal: 46B09

Hexadecimal: 172b9

Square: 9006959025

Square Root: 308.0665512515112

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

Times in hours,minutes and seconds (to the nearest second) at which the smoothly crossing minute and hour hands of an analog clock coincide, over a period of one complete 12-hour sweep of the hour hand. A120500

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum. A185614

The Wiener index of the ortho-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references). A216108

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums. A186871

Number of (n+1)X2 0..2 arrays with every 2X2 subblock sum equal to some horizontal or vertical neighbor 2X2 subblock sum. A185610

Numbers k such that k = x + y, k' = x' + y' and k'' = x'' + y'', where k' and k'' are the first and second arithmetic derivatives of k. A293252

a(1) = 1; a(n+1) = sum of terms in continued fraction for sum{k=1 to n}[a(n+1-k)/a(k)]. A57873

Expansion of e.g.f.: exp(6·x)/(1-6·x)^1/6. A94905

Composite squarefree numbers n such that p(i)+4 divides n-4, where p(i) are the prime factors of n. A225714