Properties of the Number 76480

Seventy-Six Thousand Four Hundred Eighty

Basics

Value: 76479 → 76480 → 76481

Parity: even

Prime: No

Previous Prime: 76471

Next Prime: 76481

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁶ × 5 × 239

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10010101011000000

Octal: 225300

Duodecimal: 38314

Hexadecimal: 12ac0

Square: 5849190400

Square Root: 276.5501762790977

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

Octagonal numbers which are the sums of exactly two positive octagonal numbers. A136346

a(n) is the least number k such that the equation φ(x) = k has exactly n solutions and the arithmetic mean of these solutions is an integer, or -1 if no such number exists. A389860

100-gonal numbers: a(n) = 98·n*(n-1)/2 + n. A261276

E.g.f.: Limit_N->oo [ ∑_n>=0 (N + 2·n)^2·n * (x/N)ⁿ/n! ]^1/N. A266485

a(n) = coefficient of xⁿ*yⁿ⁺¹/n! in (1/4) * log( ∑_n>=0 (n + 2·y)^2·n * xⁿ/n! ). A359926

The original n X n X n dots problem: minimal number of straight lines (connected at their endpoints) required to join all the n³ points belonging to the set {{0,1,...,n-1} X {0,1,...,n-1} X {0,1,...,n-1}} in R³, without any additional constraint. A363755

a(n) = n + μ(rad(n)), where μ is the Moebius function (A008683) and rad is the squarefree kernel (A007947). A76480