Properties of the Number 73151

Seventy-Three Thousand One Hundred Fifty-One

Basics

Value: 73150 → 73151 → 73152

Parity: odd

Prime: No

Previous Prime: 73141

Next Prime: 73181

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 13 × 17 × 331

Divisors: 1, 13, 17, 221, 331, 4303, 5627, 73151

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001110110111111

Octal: 216677

Duodecimal: 363BB

Hexadecimal: 11dbf

Square: 5351068801

Square Root: 270.46441540431897

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

Number of solenoidal flows (flow in = flow out) in a 3 X 3 square array with integer velocities -n .. n. A68722

Nonprime numbers n such that φ(n) divides n² - 1, where φ(n) (A000010) is Euler's totient function. A98271

Pentagonal numbers (A000326) whose digit reversal is a prime. A115707

Pentagonal numbers with only odd digits. A117985

Number of (w,x,y,z) with all terms in {1,...,n} and w > |x-y| + |y-z|. A212674

a(n) = (A388291(n)² - 1)/24. A389355

Number of solenoidal flows (flow in = flow out) in an n X n square array with integer velocities in -10 .. 10. A68735

Three-column array giving list of primitive triples for integer-sided triangles with A < B < C < 2*π/3 and such that FA, FB, FC are also integers where F is the Fermat point of the triangle. A352360

If F is the Fermat point of a triangle ABC with A < B < C < 2*π/3, where AB, BC, CA, FA, FB and FC are all positive integers, then, this sequence gives the sum FA + FB + FC when gcd(a, b, c) = A351477(n). A351476

Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n+1,0)=A006319(n)=a(n,0) + Sum a(k,k), k=0..n-1. a(n,m+1)= a(n,0) + Sum A006319(k)*a(n-k-1,0), k=0..m-1. A73151