Properties of the Number 30770

Thirty Thousand Seven Hundred Seventy

Basics

Value: 30769 → 30770 → 30771

Parity: even

Prime: No

Previous Prime: 30763

Next Prime: 30773

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 17 × 181

Divisors: 1, 2, 5, 10, 17, 34, 85, 170, 181, 362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100000110010

Octal: 74062

Duodecimal: 15982

Hexadecimal: 7832

Square: 946792900

Square Root: 175.41379649275024

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 (n+1)X(k+1) 0..2 arrays with no 2X2 subblock having the sum of its diagonal elements greater than the maximum of its antidiagonal elements. A251137

Number of compositions of n whose non-adjacent parts are weakly decreasing. A333148

Number of triangles larger than size=1 in a matchstick-made hexagon with side length n. A307253

Numbers that can be represented as a sum of two distinct nontrivial prime powers in three or more ways. A225104

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

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

Number of length n+2 0..2 arrays with at most one downstep in every n consecutive neighbor pairs. A255109

a(n) = least k such that s(k) = n, where s = A030767. A30770