Properties of the Number -5395

Three Hundred Ninety-Five

Basics

Value: -5396 → -5395 → -5394

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 13 × 83

Divisors: 1, 5, 13, 65, 83, 415, 1079, 5395

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010100010011

Octal: -12423

Duodecimal: -3157

Hexadecimal: -1513

Square: 29106025

Square Root: 73.45066371381542

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

a(n) = (n+1)*(n² +8·n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times. A8778

a(n) = floor(a(n-1)*3/2) with a(1) = 2. A61418

Coordination sequence for (2,3,7) tiling of hyperbolic plane. A265057

Number of times prime(n) (the n-th prime) occurs as the least prime factor among numbers 1 .. (prime(n)² * prime(n+1)): a(n) = A078898(A251720(n)). A250477

Number of compositions of n with no part divisible by the next or the prior. A328508

Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes. A64687

Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number. A79053

Numbers that are the sum of five fourth powers in exactly two ways. A344237

Numbers that are the sum of five fourth powers in two or more ways. A344238

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