Properties of the Number 4823

Four Thousand Eight Hundred Twenty-Three

Basics

Value: 4822 → 4823 → 4824

Parity: odd

Prime: No

Previous Prime: 4817

Next Prime: 4831

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 13 × 53

Divisors: 1, 7, 13, 53, 91, 371, 689, 4823

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011010111

Octal: 11327

Duodecimal: 295B

Hexadecimal: 12d7

Square: 23261329

Square Root: 69.44782214007866

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

a(n) = floor(n(n+2)(2n+1)/8). A2717

Numbers k such that 3^k - 4 is prime. A58959

Expansion of 1/(1 - x - x⁴ + x⁶). A174522

a(n) = n*(n + 1)*(n + 2)*(3·n + 17)/24. A241765

T(n,k) = Number of lower triangles of an n X n 0..k array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by two or less. A195248

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically. A208028

Smith numbers of order 2. A174460

a(n) = number of steps to reach 0 when starting from k = (n³)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261228

Numbers k for which A276085(k) is a multiple of 3125, where A276085 is fully additive with a(p) = p#/p. A377878

a(n) = ∑_{k=0..floor(n/3)} binomial(k,2·n-6·k). A391399