Properties of the Number 65853

Sixty-Five Thousand Eight Hundred Fifty-Three

Basics

Value: 65852 → 65853 → 65854

Parity: odd

Prime: No

Previous Prime: 65851

Next Prime: 65867

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ⁵ × 271

Divisors: 1, 3, 9, 27, 81, 243, 271, 813, 2439, 7317

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000100111101

Octal: 200475

Duodecimal: 32139

Hexadecimal: 1013d

Square: 4336617609

Square Root: 256.6183937288985

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

Almkvist-Zudilin numbers: ∑_k=0..n (-1)^n-k * ((3^n-3·k * (3·k)!) / (k!)³) * binomial(n,3·k) * binomial(n+k,k). A125143

Number of length 2+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero. A250321

Numbers n such that n * (x-1)/x produces a rotation of the digits in n for some value of x. A288626

Expansion of e.g.f.: cosh(sinh(x)+log(x+1))=1+4/2!*x²-6/3!*x³+43/4!*x⁴-170/5!*x⁵... A13022

Lee's empirically improved Tokuda gaps for shellsort. A366726

Let u be any string of 4 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u). A65853

Let c (resp. C) be the smallest (resp. largest) number that can be obtained by cyclically permuting the digits of n; a(n) = C - c. A347688

a(n) is the least integer b such that the fractions (b⁰)/p, (b¹)/p, ..., (b^r-1)/p where p is the n-th prime, produce the A006556(n) distinct cycles. A334904