Properties of the Number 42852

Forty-Two Thousand Eight Hundred Fifty-Two

Basics

Value: 42851 → 42852 → 42853

Parity: even

Prime: No

Previous Prime: 42841

Next Prime: 42853

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 3571

Divisors: 1, 2, 3, 4, 6, 12, 3571, 7142, 10713, 14284

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010011101100100

Octal: 123544

Duodecimal: 20970

Hexadecimal: a764

Square: 1836293904

Square Root: 207.00724624998034

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*φ¹⁷), where φ is the golden ratio, A001622. A4932

Numbers that are the sum of seven fourth powers in exactly eight ways. A345830

Integer part of square root of n-th Fibonacci number. A61287

Where records occur in A144294. A144295

Monotonic ordering of set S generated by these rules: if·and y are in S then x²+y²-xy is in S, and 2 is in S. A192533

Expansion of ∏_k>0 (1 - x^k)^k·3. A276552

a(n+1) is the smallest number > a(n) such that the digits of a(n)² are all (with multiplicity) contained in the digits of a(n+1)², with a(0)=2. A67975

Write the primes in binary; a(n) = total number of 0's in those which have an n-bit expansion. A86904

a(n) = round(sqrt(Fibonacci(n))). A100665

a(n) = round(n*φ¹⁷), where φ is the golden ratio, A001622. A4952