Properties of the Number -34992

Thirty-Four Thousand Nine Hundred Ninety-Two

Basics

Value: -34993 → -34992 → -34991

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ⁷

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000100010110000

Octal: -104260

Duodecimal: -18300

Hexadecimal: -88b0

Square: 1224440064

Square Root: 187.06148721743875

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

Triangle read by rows: T(0,0) = 1; T(n,k) = 3·T(n-1,k) - 2·T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0. Triangle of coefficients of Fermat polynomials. A303941

Triangle read by rows of coefficients in expansion of (3-2x)ⁿ, where n is a nonnegative integer. A303901

Triangle read by rows of coefficients in expansions of (-2 + 3·x)ⁿ, where n is nonnegative integer. A317498

Triangle read by rows: T(0,0) = 1; T(n,k) = 3 T(n-1,k) - 2·T(n-3,k-1) for k = 0..floor(n/3); T(n,k)=0 for n or k < 0. A317502

4-full numbers: if a prime p divides k then so does p⁴. A36967

a(n) = 9·a(n-1) - 9·a(n-2) for n>1, with a(0)=0, a(1)=1. A57085

T(n,k)=Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph. A223599

T(n,k)=Petersen graph (8,2) coloring a rectangular array: number of nXk 0..15 arrays where 0..15 label nodes of a graph with edges 0,1 0,8 8,14 8,10 1,2 1,9 9,15 9,11 2,3 2,10 10,12 3,4 3,11 11,13 4,5 4,12 12,14 5,6 5,13 13,15 6,7 6,14 7,0 7,15 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph. A223692

Cubefull Achilles numbers. A388293

Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 9. A195093