Properties of the Number 63439

Sixty-Three Thousand Four Hundred Thirty-Nine

Basics

Value: 63438 → 63439 → 63440

Parity: odd

Prime: Yes

Previous Prime: 63421

Next Prime: 63443

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 63439

Divisors: 1, 63439

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011111001111

Octal: 173717

Duodecimal: 30867

Hexadecimal: f7cf

Square: 4024506721

Square Root: 251.87099872752322

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

Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees. A83930

a(n) = floor(9ⁿ/7ⁿ). A94991

Numbers k such that 153·2^k-1 is prime. A50618

a(n) = the smallest positive integer m with exactly n (no more, no fewer) distinct primes represented in binary as substrings within the binary representation of m. A146526

a(n) = φ(n)^φ(n). A63439

Consider the graph of symmetric primes where p and q are connected if |p-q| = gcd(p-1,q-1). This sequence is an irregular table where the n-th row lists the first symmetric prime in a connected component with n vertices, with one representative for each nonisomorphic graph. Within a row, graphs are ordered by increasing size of its initial prime. A358312