Properties of the Number 4766

Four Thousand Seven Hundred Sixty-Six

Basics

Value: 4765 → 4766 → 4767

Parity: even

Prime: No

Previous Prime: 4759

Next Prime: 4783

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 2383

Divisors: 1, 2, 2383, 4766

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1001010011110

Octal: 11236

Duodecimal: 2912

Hexadecimal: 129e

Square: 22714756

Square Root: 69.03622237637282

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 unlabeled rooted trees with n nodes (or connected functions with a fixed point). A81

Numbers k that divide the (right) concatenation of all numbers <= k written in base 2 (most significant digit on left). A29447

Number of primes less than 10ⁿ which do not contain the digit 9. A91643

Rooted tree triangle read by rows: a(n,k) = number of forests with n nodes and k rooted trees. A33185

Number of distinct values taken by 9⁹^...⁹ (with n 9's and parentheses inserted in all possible ways). A145549

Number of distinct values taken by 10¹⁰^...¹⁰ (with n 10's and parentheses inserted in all possible ways). A145550

a(n) = n² + (n+1)² + (n+2)² + (n+3)². A27575

T(n,k) = Number of n X k arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 n X k array. A220761

Number of rooted unlabeled trees on n nodes where each node has at most 11 children. A292556

Triangle T(n,k), n >= 1, 1 <= k <= n, read by rows, where sequence a_k of column k has a_k(0)=0, followed by (k+1)-fold 1 and a_k(n) shifts k places left under Euler transform. A144018