Properties of the Number -9403

Four Hundred Three

Basics

Value: -9404 → -9403 → -9402

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 9403

Divisors: 1, 9403

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010010111011

Octal: -22273

Duodecimal: -5537

Hexadecimal: -24bb

Square: 88416409

Square Root: 96.96906723280368

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

Expansion of 1 / ∑_{k in Z} x^2·k / (1 - x^5·k+2). A375061

Primes p such that a pure prime power occurs between p and the next prime. A53607

a(n) = n·a(n-1) + (n-2)*a(n-2), with a(0) = 0, a(1) = 1. A153

Triangle T(n, k), read by row, related to Euler's difference table A068106 (divide column k of A068106 by k!). A86764

Numerators of continued fraction convergents to sqrt(7). A41008

Largest prime below prime(n)² (A001248). A54270

T(n,k) = 1/16 the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease, and at least two adjacent blocks having the same increasing direction. A183738

Consider two consecutive primes {p,q} such that P=2p+q and Q=2q+p are both prime. Sequence gives lesser primes p. A181848

Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n). A76731

a(n) = (1/n!)*A023043(n). A94795