Properties of the Number -54421

Fifty-Four Thousand Four Hundred Twenty-One

Basics

Value: -54422 → -54421 → -54420

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 54421

Divisors: 1, 54421

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101010010010101

Octal: -152225

Duodecimal: -275B1

Hexadecimal: -d495

Square: 2961645241

Square Root: 233.28308982864576

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(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of n, n-1, n-2, n-3, ... down to 1. A75021

Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively. A340157

Primes p such that p, p + 1, p + 2 and p + 3 have 2, 4, 6 and 8 divisors respectively. A340871

Numbers k such that d(k) < d(k+1) < d(k+2) < d(k+3) < d(k+4), where d(n) is the number of divisors of n. A364717

Terms k of A112998 such that k+2 is nonsquarefree. A328160

Prime numbers such that the product of their digits equals twice the number of their digits times the sum of their digits. A343701

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (-1, 1, -1), (0, 1, 1), (1, -1, 0)}. A148346

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, -1), (0, 1, 1), (1, -1, 0)}. A148347

A general recursion triangle with third part a power triangle:m=3; Power triangle: f(n,k,m)=If[n·k*(n - k) == 0, 1, n^m - (k^m + (n - k)^m)]; Recursion: A(n,k,m)=(m*(n - k) + 1)*A(n - 1, k - 1, m) + (m·k + 1)*A(n - 1, k, m) + m·f(n, k, m)*A(n - 2, k - 1, m). A157630

a(n) is the number of digits in the decimal representation of the smallest power of 6 that contains n consecutive identical digits. A217188