Properties of the Number -50461

Fifty Thousand Four Hundred Sixty-One

Basics

Value: -50462 → -50461 → -50460

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 50461

Divisors: 1, 50461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100010100011101

Octal: -142435

Duodecimal: -25251

Hexadecimal: -c51d

Square: 2546312521

Square Root: 224.6352599215003

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

Numbers k such that (3^k + 19^k)/22 is prime. A128075

Primes p such that q-p = 36, where q is the next prime after p. A134117

Base-6 pandigital primes: primes having at least one of each digit 0,1,2,3,4,5 when written in base 6. A175278

Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1. A357329

a(n) = 60·n² + 1. A158673

Greater of twin primes p such that 3·p-2 is also greater of twin primes. A177336

Number of 1..n integer arrays v[1..8] of length 8 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..7. A171345

Number of 1..4 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171278

a(n) is the shyest prime in base n. A272043

k such that 0 = ∑_j=1..k A373223(k, j). The indices of the rows in Gauss's triangle with vanishing row sums. A373181