Properties of the Number -5469

Four Hundred Sixty-Nine

Basics

Value: -5470 → -5469 → -5468

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 1823

Divisors: 1, 3, 1823, 5469

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010101011101

Octal: -12535

Duodecimal: -31B9

Hexadecimal: -155d

Square: 29909961

Square Root: 73.95268757793728

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

The Möbius function of the poset of all permutations, ordered by pattern containment, of length at most n, with an added top element. A262751

Number of set partitions of strict integer partitions of n that have distinct block-sums. A279375

Number of partitions of n containing no part i of multiplicity i. A276429

Exp(n) is closer to an integer than any previous exp(k) for 1 <= k < n. A79490

a(1)=3; for n > 1, a(n) = 1 + a(n-1) + gcd( a(n-1)*(a(n-1)+2), A073829(a(n-1)) ). A167053

Minimal exponents m such that the fractional part of e^m obtains a minimum (when starting with m=1). A153701

Numbers k such that the fractional part of e^k is less than 1/k. A153702

Dispersion of A016873, (5k+4), by antidiagonals. A191706

Number of intersection points formed by drawing the line segments connecting any two lattice points of an n X m convex lattice polygon written as triangle T(n,m), n >= 1, 1 <= m <= n. A288180

G.f. A(x) satisfies A(x) = 1 + x/A(-x·A(x))³. A384896