Properties of the Number -50435

Fifty Thousand Four Hundred Thirty-Five

Basics

Value: -50436 → -50435 → -50434

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 11 × 131

Divisors: 1, 5, 7, 11, 35, 55, 77, 131, 385, 655

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100010100000011

Octal: -142403

Duodecimal: -2522B

Hexadecimal: -c503

Square: 2543689225

Square Root: 224.5773808734976

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

Indices of primes at which the prime race 4k-1 vs. 4k+1 is tied. A38691

a(n) = ∑_k=1..n floor(n/k)³. A318742

Column 3 of array in A226513. A226514

Odd numbers with exactly 4 distinct palindromic prime factors. A46406

Consider all integer triples (i,j,k), j >= k > 0, with i³ = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values. A54208

Quasi-Carmichael numbers to base 3: squarefree composites n such that prime p∣n ==> p-3∣n-3. A29560

a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero dodecahedral numbers in exactly n ways, or -1 if no such integer exists. A360216

Triangle T(n, k) = [x^k]( p(n,x) ), where p(n, x) = ∑_k=1..n A001263(n,k)*binomial(x+k -1, n-1), read by rows. A168391