Properties of the Number 726

Seven Hundred Twenty-Six

Basics

Value: 725 → 726 → 727

Parity: even

Prime: No

Previous Prime: 719

Next Prime: 727

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 11 ²

Divisors: 1, 2, 3, 6, 11, 22, 33, 66, 121, 242

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011010110

Octal: 1326

Duodecimal: 506

Hexadecimal: 2d6

Square: 527076

Square Root: 26.94438717061496

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

Pentagonal pyramidal numbers: a(n) = n²*(n+1)/2. A2411

Inverse Möbius transform of A003961; a(n) = σ(A003961(n)), where A003961 shifts the prime factorization of n one step towards the larger primes. A3973

Increasing sequence generated by these rules: a(1)=1, and if·is in a then 3x-2 and 4x-2 are in a. A191113

a(n) = 6·n². A33581

Number of partitions of n where n divides the product of the parts. A57568

Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0)=1, T(n,k)=0 if n < k, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1). A64189

G.f.: ∏_j>=1 ∏_i>=1 (1 + x^i·j). A107742

Number of n-step self-avoiding walks on cubic lattice. A1412

Motzkin triangle, T, read by rows; T(0,0) = T(1,0) = T(1,1) = 1; for n >= 2, T(n,0) = 1, T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 1,2,...,n-1 and T(n,n) = T(n-1,n-2) + T(n-1,n-1). A26300

Numbers obtained by reinterpreting base-2 representation of n in the factorial base: a(n) = ∑_k>=0 A030308(n,k)*A000142(k+1). A59590