Properties of the Number 2390

Two Thousand Three Hundred Ninety

Basics

Value: 2389 → 2390 → 2391

Parity: even

Prime: No

Previous Prime: 2389

Next Prime: 2393

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 239

Divisors: 1, 2, 5, 10, 239, 478, 1195, 2390

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101010110

Octal: 4526

Duodecimal: 1472

Hexadecimal: 956

Square: 5712100

Square Root: 48.88762624632127

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 BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order. A35928

a(n) = minimal positive k such that the concatenation of the decimal digits of n,n+1,...,n+k is divisible by n+k+1, or -1 if no such k exists. A332580

Number of representations of n as a sum of products of pairs of integers larger than 1, considered to be equivalent when terms or factors are reordered. A182270

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

a(0)=a(1)=...=a(9)=1; a(n) = - a(n-1) + a(n-3) + a(n-4) + a(n-5) + a(n-6) + a(n-7) - a(n-9) - a(n-10). A125950

T(n,k) = coefficient of xⁿ*y^k in A(x,y) such that: x = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (y + xⁿ)ⁿ * A(x,y)ⁿ. A359720

Starting with a(1)=2: if m is a term then also 4·m+1 and 4·m+2. A179888

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234564

Numbers k such that A003313(k) = A003313(3·k). A116459

Integers having ideal digital mean up to base 3. A144798