Properties of the Number 66853

Sixty-Six Thousand Eight Hundred Fifty-Three

Basics

Value: 66852 → 66853 → 66854

Parity: odd

Prime: Yes

Previous Prime: 66851

Next Prime: 66863

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 66853

Divisors: 1, 66853

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000010100100101

Octal: 202445

Duodecimal: 32831

Hexadecimal: 10525

Square: 4469323609

Square Root: 258.55947091530027

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal. A236819

Numbers n such that the numbers of divisors of n,n+1,n+2 and n+3 are k,2k,4k,8k respectively for some k. A100364

Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal. A236813

Number of (n+1)X(4+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal. A236815

Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 30. A31618

Number of different remainders (or residues) for the Fibonacci numbers (A000045) when divided by n (i.e., the size of the set of F(i) mod n over all i). A66853

Primes such that every distinct permutation of digits is composite (including permutations with leading zeros). A39986

The number of iterations giving new primes for the bases of A217679. A217680