Properties of the Number 47768

Forty-Seven Thousand Seven Hundred Sixty-Eight

Basics

Value: 47767 → 47768 → 47769

Parity: even

Prime: No

Previous Prime: 47743

Next Prime: 47777

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 7 × 853

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 853, 1706

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011101010011000

Octal: 135230

Duodecimal: 23788

Hexadecimal: ba98

Square: 2281781824

Square Root: 218.55891654197043

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 unordered rooted trees where each subtree from given node has the same number of nodes. A127524

Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^n-1 starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words·and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1. A93370

a(n) = 2ⁿ - A122536(n). A121880

a(n) = A047766(6n+2). A47768

Positive integers k such that each digit of k² is a factor of k. A376003