Properties of the Number -39283

Thirty-Nine Thousand Two Hundred Eighty-Three

Basics

Value: -39284 → -39283 → -39282

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 163 × 241

Divisors: 1, 163, 241, 39283

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001100101110011

Octal: -114563

Duodecimal: -1A897

Hexadecimal: -9973

Square: 1543154089

Square Root: 198.19939455003387

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

Smallest number that requires n iterations of the unitary totient function (A047994) to reach 1. A3271

n³+Largest square, (Largest square <= n³). A176580

Counterbalanced numbers: Composite numbers k such that φ(k)/(σ(k)-k) is an integer. A55940

a(n) = floor(Fibonacci(n)/5). A4698

a(n) = floor( n*(n-1)*(n-2)*(n-3)/25 ). A11935

Composite numbers not divisible by 2 or 3 which in base 3 contain their largest proper factor as a substring. A63132

a(n) = floor(L³*{φ^3·n-2, φ^3·n-1, φ^3·n-2 + φ^3·n-1}) where L = (1 + sqrt(5))/(2·sqrt(5)) and φ = (1 + sqrt(5))/2. A115315

Number of (n+1)X(3+1) arrays of permutations of 0..n·4+3 with each element having directed index change 1,0 1,1 0,-1 or -1,1. A264564

a(n) = a(n-1) + 2·a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1. A298415

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, -1), (1, -1, 0), (1, 1, 0)}. A149348