Properties of the Number 4781

Four Thousand Seven Hundred Eighty-One

Basics

Value: 4780 → 4781 → 4782

Parity: odd

Prime: No

Previous Prime: 4759

Next Prime: 4783

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 7 × 683

Divisors: 1, 7, 683, 4781

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010101101

Octal: 11255

Duodecimal: 2925

Hexadecimal: 12ad

Square: 22857961

Square Root: 69.14477565225012

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

Least sum of 3 distinct nonzero squares in exactly n ways. A25415

Number A(n,k) of factorizations of mⁿ into n factors, where m is a product of exactly k distinct primes and each factor is a product of k primes (counted with multiplicity); square array A(n,k), n>=0, k>=0, read by antidiagonals. A257462

Numbers k such that A003313(k) = A003313(3·k). A116459

Integers that need 7 iterations of the map x->A352172(x) to reach 1. A352265

a(n) is the number of compositions of n in which the maximal part is 3. A100

a(n) = number of Egyptian fractions 1 = 1/x₁ + ... + 1/x_k (for any k), with 0 < x₁ <= ... <= x_k = n. A92666

The 360 degree spoke (or ray) of a hexagonal spiral of Ulam. A244803

Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1. A5424

Triangle c(n,k) of the numerators of coefficients [x^k] P(n,x) of the polynomials P(n,x) of A129891. A140749

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A300937