Properties of the Number -40789

Forty Thousand Seven Hundred Eighty-Nine

Basics

Value: -40790 → -40789 → -40788

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 7 × 5827

Divisors: 1, 7, 5827, 40789

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001111101010101

Octal: -117525

Duodecimal: -1B731

Hexadecimal: -9f55

Square: 1663742521

Square Root: 201.9628678742704

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

T(n,k)=Number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7. A258631

a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit. A95204

Number of ternary strings of length n that contain at least two 0's and at most two 1's. A338232

a(n) = number of conjugacy classes in PSL₄(prime(n)). A124681

a(n) is the smallest number greater than a(n-1) such that in a(1) through a(n) no digit occurs more than once more than any other digit, starting with a(1) = 1. A248651

Number of length n 1..(5+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7. A258628

Number of length 7 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7. A258638

Triangle read by rows where T(n,k) is the number of chains of length k from minimum to maximum in the poset of integer partitions of n ordered by refinement. A330785