Properties of the Number -141759

One Hundred Forty-One Thousand Seven Hundred Fifty-Nine

Basics

Value: -141760 → -141759 → -141758

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 19 × 829

Divisors: 1, 3, 9, 19, 57, 171, 829, 2487, 7461, 15751

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100010100110111111

Octal: -424677

Duodecimal: -6A053

Hexadecimal: -229bf

Square: 20095614081

Square Root: 376.50896403671453

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

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards. A206542

a(0)=1, a(n) = sigma₃(2n). A91986

a(n) = sigma₃(3n+2). A92343

Number of (n+1) X 4 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards. A206537

Number of (n+1) X (n+1) 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards. A206534

Let sequence B_n={b_m} be defined by: b₁=prime(n), b₂=prime(n+1); for m>=3, b_m=b_m-2+b_m-1 if b_m-2+b_m-1 is not semiprime, otherwise b_m is the least prime divisor of b_m-2+b_m-1. Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded. A221218