Properties of the Number 4767

Four Thousand Seven Hundred Sixty-Seven

Basics

Value: 4766 → 4767 → 4768

Parity: odd

Prime: No

Previous Prime: 4759

Next Prime: 4783

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 227

Divisors: 1, 3, 7, 21, 227, 681, 1589, 4767

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001010011111

Octal: 11237

Duodecimal: 2913

Hexadecimal: 129f

Square: 22724289

Square Root: 69.04346457123947

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 integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions. A364345

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (3,n)-rectangular grid with k '1's and (3n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A226290

Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (6,n)-rectangular grid with k '1's and (6n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other. A228165

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 8 multiples of n-1, n-2, ..., 1, for n>=1. A113745

Beginning with 3, least number such that concatenation of first n terms and its digit reversal both are primes. A111382

Numbers k such that the number of digits d in k² is not prime and for each factor f of d the sum of the d/f digit groupings in k² of size f is a square. A153745

a(n) = Index k where A227183(k) for the first time gets value n; the runlength binary code for minimally runlength-encoded unordered partition of size n. A227368

Number of integer partitions of n where the parts have lesser mean than the distinct parts. A360251

Triangle of numerators of coefficients of the polynomial Q_m(n) defined by the recursion Q₀(n)=1; for m >= 1, Q_m(n) = ∑_i=1..n i·Q_m-1(i). For m >= 1, the denominator for all 2·m+1 terms of the m-th row is A053657(m+1). A202339

Least positive integer k such that prime(k·n) - 1 = (prime(i·n)-1)*(prime(j·n)-1) for some integers 0 < i < j < k. A257938