Properties of the Number 4852

Four Thousand Eight Hundred Fifty-Two

Basics

Value: 4851 → 4852 → 4853

Parity: even

Prime: No

Previous Prime: 4831

Next Prime: 4861

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 1213

Divisors: 1, 2, 4, 1213, 2426, 4852

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001011110100

Octal: 11364

Duodecimal: 2984

Hexadecimal: 12f4

Square: 23541904

Square Root: 69.65629906907199

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

Coordination sequence for "pcu-i" 3D uniform tiling. A299277

Sum of squares of four consecutive primes. A133524

Number of partitions of n such that number of parts is equal to the sum of parts counted without multiplicities. A114638

Triangle read by rows: T(n,k) = number of vertices in a "frame" of size n X k (see Comments in A331457 for definition). A332599

Triangle read by rows: T(n,k) is the number of sensed combinatorial maps with n edges and genus k, 0 <= k <= floor(n/2). A379438

Number of sensed genus 1 maps with n edges. A6386

Integers n > 196 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 196. A63049

Numbers k such that φ(k) = φ(k+4), with Euler's totient function φ = A000010. A179186

a(n)=a(n-1)+a(m), where m=2n-2-2^p+1 and 2^p<n-1<=2^p+1, for n >= 4. A50059

Triangle read by rows: For n >= 0, k >= 0, T(n,k) is the number of permutations π of n such that the total distance Sum_i abs(i-π(i)) = 2k. Equivalently, k = Sum_i max(i-π(i),0). A62869