Properties of the Number -171045

One Hundred Seventy-One Thousand Forty-Five

Basics

Value: -171046 → -171045 → -171044

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 7 × 181

Divisors: 1, 3, 5, 7, 9, 15, 21, 27, 35, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101001110000100101

Octal: -516045

Duodecimal: -82B99

Hexadecimal: -29c25

Square: 29256392025

Square Root: 413.5758697022833

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

Triangle T(n,k) read by rows: number of rooted chains of length k in set partitions of n labeled points. A331956

Triangular array read by rows. T(n,k) is the number of digraphs with n labeled nodes having exactly k undirected (or weak) components, n >= 1, 1 <= k <= n. A189898

Number of nX2 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317817

Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and w+5x+5y>0. A211627

Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0. A211630

Triangle read by rows: let T(n,k) (for n >= 0, 0 <= k <= n) be the number of walks from (0,0) to (n,k) using steps (1,1), (1,0), (1,-1) and (0,-1); n-th row of triangle gives T(n,n), T(n,n-1), ..., T(n,0). A223092

Odd solid numbers that are not odd primitive abundant numbers. A number k is solid if a subset of its sum-irreducible nontrivial divisors sums to k. Sum-irreducible divisors are defined in A392650. A392651