Properties of the Number -23407

Twenty-Three Thousand Four Hundred Seven

Basics

Value: -23408 → -23407 → -23406

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 89 × 263

Divisors: 1, 89, 263, 23407

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101101101101111

Octal: -55557

Duodecimal: -11667

Hexadecimal: -5b6f

Square: 547887649

Square Root: 152.99346391267832

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

Odd Fibonacci pseudoprimes: odd composite numbers k such that either (1) k divides Fibonacci(k-1) if k == +-1 (mod 5) or (2) k divides Fibonacci(k+1) if k == +-2 (mod 5). A81264

Composite numbers k that divide Fibonacci(k+1). A69107

Number of integer compositions of n that have only one part or whose consecutive parts are coprime and the last and first part are also coprime. A318748

Odd composite integers m such that F(m)² == 1 (mod m), where F(m) is the m-th Fibonacci number. A337231

Odd composites m that divide Fibonacci(m)-1. A94394

Numbers k which divide the sum of the Fibonacci numbers F(1) through F(k) and such that k is not a multiple of 24. A124456

Lucas pseudoprimes. A217120

Odd integers m that divide the sum of the first m nonzero Fibonacci numbers. A331976

Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol. A340097

Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol. A340099