Properties of the Number 30766

Thirty Thousand Seven Hundred Sixty-Six

Basics

Value: 30765 → 30766 → 30767

Parity: even

Prime: No

Previous Prime: 30763

Next Prime: 30773

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 15383

Divisors: 1, 2, 15383, 30766

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100000101110

Octal: 74056

Duodecimal: 1597A

Hexadecimal: 782e

Square: 946546756

Square Root: 175.4023945104513

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

T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222573

T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and vertical neighbors in a random 0..3 nXk array. A220805

Number of nX5 0..2 arrays with no more than floor(nX5/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222570

Number of partitions of n into parts not of the form 17k, 17k+8 or 17k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 7 are greater than 1. A35969

Values of k at which the ratio k/A005132(k) sets a new record. A330788

Sum of neighbor maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and vertical neighbors in a random 0..3 nX3 array. A220802

Number of subsets of {1,...,n} containing n and having at least one set partition into 10 blocks with equal element sum. A248119

Sum of neighbor maps: number of n X 5 binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and vertical neighbors in a random 0..3 n X 5 array. A220804

Number of 5Xn 0..2 arrays with no more than floor(5Xn/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A222577

Number of (n+1)X(n+1) 0..1 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements. A251121