Properties of the Number 60060

Sixty Thousand Sixty

Basics

Value: 60059 → 60060 → 60061

Parity: even

Prime: No

Previous Prime: 60041

Next Prime: 60077

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 × 7 × 11 × 13

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 11, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110101010011100

Octal: 165234

Duodecimal: 2A910

Hexadecimal: ea9c

Square: 3607203600

Square Root: 245.07141816213493

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

Primorial inflation of n: Fully multiplicative with a(p) = p# for prime p, where x# is the primorial A034386(x). A108951

Landau's function g(n): largest order of permutation of n elements. Equivalently, largest LCM of partitions of n. A793

a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m. A60735

Octagonal pyramidal numbers: a(n) = n*(n+1)*(2·n-1)/2. A2414

a(n) = (2·n+3)!/(6·n!*(n+1)!). A2802

If 2n = 2^e1 + 2^e2 + ... + 2^ek [e1 .. ek distinct], then a(n) = A002110(e1) * A002110(e2) * ... * A002110(ek). A283477

Array T(i,j) = binomial(-1/2-i,j)*(-4)^j, i,j >= 0 read by antidiagonals going down. A46521

Least integer of each prime signature, in graded (reflected or not) colexicographic order of exponents. A36035

Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n. A88617

Canonical partition sequence (see A080577) encoded by prime factorization. The partition [p1,p2,p3,...] with p1 >= p2 >= p3 >= ... is encoded as 2^p1 * 3^p2 * 5^p3 * ... . A63008