Properties of the Number -48127

Forty-Eight Thousand One Hundred Twenty-Seven

Basics

Value: -48128 → -48127 → -48126

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 17 × 19 × 149

Divisors: 1, 17, 19, 149, 323, 2533, 2831, 48127

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1011101111111111

Octal: -135777

Duodecimal: -23A27

Hexadecimal: -bbff

Square: 2316208129

Square Root: 219.37866806050218

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

Numbers k such that the odd part of (1+k) divides (1+A003961(k)), where A003961 is fully multiplicative with a(p) = nextprime(p). A387411

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 613", based on the 5-celled von Neumann neighborhood. A283293

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 633", based on the 5-celled von Neumann neighborhood. A290065

a(n) = (n⁴ + 46·n³ - 169·n² + 146·n + 24)/24. A143059

Number of 0..2 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171308

Number of 0..n-1 integer arrays v[1..14] of length 14 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..13. A171365