Properties of the Number 20313

Twenty Thousand Three Hundred Thirteen

Basics

Value: 20312 → 20313 → 20314

Parity: odd

Prime: No

Previous Prime: 20297

Next Prime: 20323

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 37 × 61

Divisors: 1, 3, 9, 37, 61, 111, 183, 333, 549, 2257

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111101011001

Octal: 47531

Duodecimal: B909

Hexadecimal: 4f59

Square: 412617969

Square Root: 142.52368224263643

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 of the form HMMSS with primes H < 24 and MM, SS < 60, for which the number of seconds after midnight, 3600·H+60·MM+SS, is also prime. A295011

Prime time numbers on 6-digit clocks: numbers of the form HMMSS where H, MM, SS are primes, H < 24, MM and SS < 60. A295014

Expansion of 3·q^1/3 * φ(q) * ψ(q⁶) / c(q) in powers of·where φ(), ψ() are Ramanujan θ functions and c() is a cubic AGM θ function. A233037

Numbers n such that n and n-1 are differences between 2 positive cubes in at least one way. A38595

The number of distinct positions on an infinite chessboard reachable by the (2,3)-leaper (or zebra) in at most n moves. A297740

Irregular triangular array T; row n shows the coefficients of the (n-1)-st polynomial in the obverse convolution s(x)**t(x), where s(x) = x+1 and t(x) = F(n) = n-th Fibonacci number. See Comments. A375047

Terms of A110566 grouped. A112811

Expansion of ∏_n>=1 (1 - x^5·n)/(1 - xⁿ)³ in powers of x. A278668

Numbers n such that (i) the largest prime factor of n is not a palindrome and (ii) the sum of the factorials of the digits of n is equal to the largest prime factor of n reversed. A74301

Let f(k) denote the largest prime factor of k which is not a palindrome. Sequence gives numbers k such that the sum of the factorials of the digits of k is equal to f(k) reversed. A111185