Properties of the Number 30055

Thirty Thousand Fifty-Five

Basics

Value: 30054 → 30055 → 30056

Parity: odd

Prime: No

Previous Prime: 30047

Next Prime: 30059

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 6011

Divisors: 1, 5, 6011, 30055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010101100111

Octal: 72547

Duodecimal: 15487

Hexadecimal: 7567

Square: 903303025

Square Root: 173.36377937735438

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 binary arrays whose sum with another nXk binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order. A225900

a(n) = ∑_i=0..n-1 2ⁱ*prime(n-i). A110299

Intersection of A392605 and A392611. A392606

a(n) = 26·n² - 1. A158551

Numerators of continued fraction convergents to sqrt(366). A41692

Total area of the largest inscribed rectangles of all integer partitions of n. A182099

Numbers k such that k and k² use only the digits 0, 2, 3, 5 and 9. A136891

Number of n X 3 binary arrays whose sum with another n X 3 binary array containing no more than a single 1 has rows and columns in lexicographically nondecreasing order. A225895

a(n) = binomial(2·n+1, n-5). A30055

Number of nX4 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302305