Properties of the Number 20799

Twenty Thousand Seven Hundred Ninety-Nine

Basics

Value: 20798 → 20799 → 20800

Parity: odd

Prime: No

Previous Prime: 20789

Next Prime: 20807

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 2311

Divisors: 1, 3, 9, 2311, 6933, 20799

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000100111111

Octal: 50477

Duodecimal: 10053

Hexadecimal: 513f

Square: 432598401

Square Root: 144.21858410066298

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

Integers k such that nextprime(k⁵) - prevprime(k⁵) = 4. A90123

Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition). A121118

a(n) = 52·n² - 1. A158640

Number of 3 X 3 matrices with unit determinant and nonnegative integer entries whose sum is n. A361083

Numbers k such that σ(k-3) + σ(k+3) = σ(2·k). A67129

Number of graphical partitions of simple Eulerian graphs (partitions given by the degrees of vertices of simple (no loops or multiple edges) graphs having only vertices of even degrees) having n edges. A69831

Integers k such that 10^k + 61 is a prime number. A135116

a(n) = A242107(n+1) * A242107(n-1) * (1 + mod(n,2)). A244373

a(n) is the least positive number k such that n is the greatest m such that k is a quadratic residue mod prime(i) for i=1..m and {k mod prime(i): i=1..m} are all distinct. A385050

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, 0, 1), (0, 1, 0), (1, -1, 0)}. A149864