Properties of the Number 67072

Sixty-Seven Thousand Seventy-Two

Basics

Value: 67071 → 67072 → 67073

Parity: even

Prime: No

Previous Prime: 67061

Next Prime: 67073

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁹ × 131

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 131, 256

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000011000000000

Octal: 203000

Duodecimal: 32994

Hexadecimal: 10600

Square: 4498653184

Square Root: 258.98262489981835

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

Difference between larger and smaller terms of n-th amicable pair. A66539

Numbers of the form p⁹*q where p and q are distinct primes. A179692

Number of different products (including the empty product) of any subset of {1, 2, 3, ..., n}. A60957

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals. A202435

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock. A235893

Generalized Fibonacci numbers A_n,4. A6209

Number of distinct values of |product(A) - product(B)| where A and B are a partition of {1,2,...,n}. A263292

Difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933. A275469

E.g.f. S(x) = Integral C(x) * C(S(x)) dx, such that C(x)² - S(x)² = 1, where S(x) = ∑_n>=0 a(n)*x^2·n+1/(2·n+1)!, with coefficients a(n) starting at n = 0. A322895

E.g.f. A(x) = C(x) + S(x) = exp( Integral C(S(x)) dx ) such that C(x)² - S(x)² = 1, where A(x) = ∑_n>=0 a(n)*xⁿ/n!, with coefficients a(n) starting at n = 0. A322897