Properties of the Number -48622

Forty-Eight Thousand Six Hundred Twenty-Two

Basics

Value: -48623 → -48622 → -48621

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 × 23 × 151

Divisors: 1, 2, 7, 14, 23, 46, 151, 161, 302, 322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1011110111101110

Octal: -136756

Duodecimal: -2417A

Hexadecimal: -bdee

Square: 2364098884

Square Root: 220.50396821826132

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) = ∑_k=0..n binomial(9·n,9·k). A94213

a(n) = floor(6ⁿ/(2+sqrt(5))ⁿ). A240734

Number of shifted Young tableaux with height <= 3. A82395

a(n) = ∑_{k=0..floor(n/9)} binomial(n,9·k). A306860

Number of closed walks of length n at a vertex of the cyclic graph on 9 nodes C₉. A94233

a(n) = [xⁿ] ∏_k>=1 (1 + x^k)^tau_n(k), where tau_n(k) = number of ordered n-factorizations of k. A321192

Integers n > 1 such that A130280(4n²) < n, i.e., there is an m < n, m > 1 such that 4n²(m² - 1) + 1 is a square. A130281

Elements of A011185 that are also the sum of a pair of distinct elements of A011185. A133605

Number of partitions p of n such that (number of odd numbers in p) is a part of p. A241545

T(n, k) is the total number of non-symmetric peaks in all partitions of n with exactly k blocks, n >= 4, 3 <= k <= n-1. A370373