Properties of the Number -46389

Forty-Six Thousand Three Hundred Eighty-Nine

Basics

Value: -46390 → -46389 → -46388

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 47 ²

Divisors: 1, 3, 7, 21, 47, 141, 329, 987, 2209, 6627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011010100110101

Octal: -132465

Duodecimal: -22A19

Hexadecimal: -b535

Square: 2151939321

Square Root: 215.3810576629245

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

Coefficient of y⁰ in G(x,y)³ where G(x,y) = ∑_n=-oo..+oo (1-xⁿ)ⁿ * xⁿ * yⁿ. A263188

Number of numbers in row n of the array at A243855. A243856

a(n) = number of special even permutations of 2·n+1. A3109

Limit number of (m-n)-almost-primes in range [2^m..2^m+1-1]. A92097

∑_{i=0..2·A053645(n)} (C(2·A053645(n),i) mod 2)*A000045(n-i) [where C(r,c) is the binomial coefficient (A007318) and A000045(n) is the n-th Fibonacci number]. A75149

Triangle read by rows: T(n,k) = number of topologies on an n-set X such that there are exactly k elements in X that are topologically distinguishable, n >= 0, 0 <= k <= n. A280192

Third row of array in A101385. A101645

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

Numbers k such that (14·10^k - 53) / 3 is prime. A280206