Properties of the Number 65473

Sixty-Five Thousand Four Hundred Seventy-Three

Basics

Value: 65472 → 65473 → 65474

Parity: odd

Prime: No

Previous Prime: 65449

Next Prime: 65479

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 233 × 281

Divisors: 1, 233, 281, 65473

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111111111000001

Octal: 177701

Duodecimal: 31A81

Hexadecimal: ffc1

Square: 4286713729

Square Root: 255.87692353942353

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

Number of aperiodic rooted trees with n nodes. A301700

Associated with alternating row sums of array in A094566. A94567

After the initial 1, numbers k such that A347381 obtains its minimum value at k, of all the divisors d of k larger than one, where A347381 is the distance from n to the nearest common ancestor of n and σ(n) in the Doudna-tree (A005940). A374218

a(n) = ceiling(Fibonacci(n)/3). A293543

a(n) = round(Fibonacci(n)/3). A293544

Composite numbers k such that A347381 obtains the same value for all divisors of k that are larger than one, where A347381 is the distance from n to the nearest common ancestor of n and σ(n) in the Doudna-tree (A005940). A374219

Worst cases for Hart's one-line factorization (OLF) method with multiplier M = 1, see comments. A284522

Decimal expansion of the strongly carefree constant: ∏_{p prime} (1 - (3·p-2)/(p³)). A65473

Ordered sequence of numbers of form (2ⁿ - 1)*2^m + 1 where n >= 1, m >= 1. A224195

Constant term in the expansion of (1 + w + x + y + z + 1/(x·y*z) + 1/(w·y*z) + 1/(w·x*z) + 1/(w·x*y))ⁿ. A361678