Properties of the Number 3090

Three Thousand Ninety

Basics

Value: 3089 → 3090 → 3091

Parity: even

Prime: No

Previous Prime: 3089

Next Prime: 3109

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 103

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 103, 206

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110000010010

Octal: 6022

Duodecimal: 1956

Hexadecimal: c12

Square: 9548100

Square Root: 55.58776843874919

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

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 9 as largest digit. A256709

Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261836

Main diagonal of array in A163280. A164000

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A253495

T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero. A231246

Non-palindromic balanced numbers (in base 10). A256075

T(n,k)=Half the number of (n+1)X(k+1) binary arrays with equal numbers of majority one 2X2 subblocks and majority zero 2X2 subblocks. A184467

Number of polyhexes with n cells that tile the plane by 180-degree rotation (Conway criterion). A75211

Start with a(1) = 1; then a(n) = smallest number > a(n-1) such that a(n) divides concat(a(1), a(2), ..., a(n)). A171785

a(n) = 14·n² - 4·n. A195023