Properties of the Number 65794

Sixty-Five Thousand Seven Hundred Ninety-Four

Basics

Value: 65793 → 65794 → 65795

Parity: even

Prime: No

Previous Prime: 65789

Next Prime: 65809

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 67 × 491

Divisors: 1, 2, 67, 134, 491, 982, 32897, 65794

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000000100000010

Octal: 200402

Duodecimal: 320AA

Hexadecimal: 10102

Square: 4328850436

Square Root: 256.50341128335896

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 forests with n nodes and height at most 2. A949

Numbers that are the sum of 4 nonzero 8th powers. A3382

Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ ∑_k>=0 y^k * R_n·k(y) ]ⁿ for n>=0, with R₀(y)=1. A124550

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_j=1..n gcd(j, n)^k. A343510

Row 3 of table A124550; also equals the self-convolution cube of A124563, which is row 3 of table A124560. A124553

Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1). A210725

a(n) = ∑_d∣n φ(d)ⁿ. A342471

a(n) = ∑_d∣n φ(n/d)^d-1. A164941

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = ∑_j=1..n floor(n/j)^k. A344725

Number of integers in n-th generation of tree T(2^-1/3) defined in Comments. A274158