Properties of the Number -11468

Eleven Thousand Four Hundred Sixty-Eight

Basics

Value: -11469 → -11468 → -11467

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 47 × 61

Divisors: 1, 2, 4, 47, 61, 94, 122, 188, 244, 2867

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110011001100

Octal: -26314

Duodecimal: -6778

Hexadecimal: -2ccc

Square: 131515024

Square Root: 107.08874824182044

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

a(n) = [(x·y)ⁿ] ∏_k>=1 (1 - x^k - y^k)^k. A381011

Numbers k such that k⁵¹² + 1 is prime. A57465

Integers that are Rhonda numbers to base 15. A100974

Number of simple connected graphs with n nodes and exactly 2 articulation points (cutpoints). A241768

a(n) equals the coefficient of xⁿ in ∑_m>=0 (x^m + 1/x^m)^m for n > 0. A304638

a(n) equals the coefficient of xⁿ in ∑_m>=0 (x^m + 2 + 1/x^m)^m for n >= 1. A316592

Ramanujan's b-series: expansion of (2-26x-12x²)/(1-82x-82x²+x³). A51029

Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n). A325111

Consider the Diophantine equation x³ + y³ = z³ + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y. A50793

Binomial transform of the characteristic function of the prime numbers (A010051). A121497