Properties of the Number 70152

Seventy Thousand One Hundred Fifty-Two

Basics

Value: 70151 → 70152 → 70153

Parity: even

Prime: No

Previous Prime: 70141

Next Prime: 70157

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 37 × 79

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 37, 74

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001001000001000

Octal: 211010

Duodecimal: 34720

Hexadecimal: 11208

Square: 4921303104

Square Root: 264.8622283376775

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 read by rows, giving coefficients of the ménage hit polynomials ordered by descending powers. T(n, k) for 0 <= k <= n. A58087

Coefficients of ménage hit polynomials. A159

Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n). A94314

Triangle T(n, k) = coefficients of p(n,x), where p(n,x) = ∑_j=0..n (2·n*(n-j)!/(2·n-j)) * binomial(2·n-j, j) * (x-1)^j and p(0,x) = 1, read by rows. A156996

Take pairs (x,y) with ∑_{j = x..y} j = concatenation of·and y. Sort pairs on y then x. This sequence gives·of each pair. A70152

Number of n X 3 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, and upper left element zero. A230836