Properties of the Number -49075

Forty-Nine Thousand Seventy-Five

Basics

Value: -49076 → -49075 → -49074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 5 ² × 13 × 151

Divisors: 1, 5, 13, 25, 65, 151, 325, 755, 1963, 3775

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011111110110011

Octal: -137663

Duodecimal: -24497

Hexadecimal: -bfb3

Square: 2408355625

Square Root: 221.5287791687572

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

Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays. A184288

Smallest number requiring n steps to reach 0 or -1 when iterating the function: f(n)=lcd(n)-lpf(n), where lcd(n) is the largest common difference between consecutive divisors of n (ordered by size) and lpf(n) is the largest prime factor of n. A74348

Number of distinct n X 4 toroidal 0..4 arrays. A184287

Odd numbers k > 1 such that A309906(k-1) < A309906(k) > A309906(k+1) < A309906(k+2) > A309906(k+3). A349938

Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1). A349941

Number of distinct n X 2 toroidal 0..4 arrays. A184285

Numbers n such that n | 5ⁿ + 4ⁿ + 1. A57302