Properties of the Number -23813

Twenty-Three Thousand Eight Hundred Thirteen

Basics

Value: -23814 → -23813 → -23812

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 23813

Divisors: 1, 23813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101110100000101

Octal: -56405

Duodecimal: -11945

Hexadecimal: -5d05

Square: 567058969

Square Root: 154.31461369552787

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

Triangle of coefficients of even modified recursive orthogonal Hermite polynomials given in Hochstadt's book:P(x, n) = x·P(x, n - 1) - n·P(x, n - 2) ;A137286; P2(x,n)=P(x,n)+P(x,2·n): second type. A136587

Primes of the form 6n² - 1. A90686

Prime(n) and prime(n+3) use the same digits. A69795

Primes p such that A001175(p) = 2*(p+1)/9. A308786

a(n) = ∑_{k=0..floor(n/3)} 2^k * binomial(2·n-4·k+1,2·k). A387625

a(n) = 54·n² - 1. A158656

[ (4th elementary symmetric function of S(n))/(2nd elementary symmetric of S(n)) ], where S(n) = {3,4, ..., n+5}. A24194

Primes of the form 5n² + 8. A201486

Least number k that reaches 1 after n iterations of A071324. A333265

Primes p such that Euler(p, 1) is an integer multiple of Bernoulli(p + 1, 1). A341759