Properties of the Number 30760

Thirty Thousand Seven Hundred Sixty

Basics

Value: 30759 → 30760 → 30761

Parity: even

Prime: No

Previous Prime: 30757

Next Prime: 30763

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 5 × 769

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 769, 1538

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100000101000

Octal: 74050

Duodecimal: 15974

Hexadecimal: 7828

Square: 946177600

Square Root: 175.38529014715002

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 n-step self-avoiding walks on cubic lattice ending at point with x = k. A227338

Number of n-step self-avoiding walks on cubic lattice ending at point with x=3. A762

Number of 2n-bead balanced binary necklaces which are not equivalent to their reverse, complement or reversed complement. A45675

The number of primes of the form i² + j⁴ (A028916) <= 2ⁿ, counted with multiplicity. A226496

Number of 2n-bead balanced binary necklaces of fundamental period 2n which are inequivalent to their reverse, complement and reversed complement. A45684

0-sequence of reduction of hexagonal numbers sequence by x² -> x+1. A192143

Number of multisets of exactly two partitions of positive integers into distinct parts with total sum of parts equal to n. A320787

Number of 3 X n integer matrices (m_i,j) such that m_1,1=0, m_3,n=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2. A323967

Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k returns to the x-axis (0<=k<=floor(n/2)). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. A114692

Number of nX4 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A305093