Properties of the Number -35385

Thirty-Five Thousand Three Hundred Eighty-Five

Basics

Value: -35386 → -35385 → -35384

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 7 × 337

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 337, 1011

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1000101000111001

Octal: -105071

Duodecimal: -18589

Hexadecimal: -8a39

Square: 1252098225

Square Root: 188.10901094843916

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

Number of nonnegative solutions to x² + y² + z² <= n². A604

Consider the Diophantine equation x³ + y³ = z³ + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y. A50793

Number of partitions p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p). A241652

Triangle read by rows, a(n,k), n>=k>=1, which represent the s=3, h=1 case of a two-parameter generalization of Stirling numbers arising in conjunction with normal ordering. A203412

a(n) = n³ + (n + 1)⁴ + (n + 2)⁵. A61223

Numbers n such that φ(n) + φ(n+1) = σ(n)/2. A76647

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..2 array extended with zeros and convolved with -1,2,-1. A222037

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, 0), (0, 1, 0), (1, -1, -1), (1, 1, 1)}. A150515