Properties of the Number -60270

Sixty Thousand Two Hundred Seventy

Basics

Value: -60271 → -60270 → -60269

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 7 ² × 41

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110101101101110

Octal: -165556

Duodecimal: -2AA66

Hexadecimal: -eb6e

Square: 3632472900

Square Root: 245.49949083450255

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

Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1). A35347

Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument. A328762

Maximum number of 6 sphinx tile shapes in a sphinx tiled hexagon of order n. A291582

a(n) = ((n + 1) - 9*(n + 1)² + 8*(n + 1)³)/6. A331987

Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2). A282575

Sums of three primorials > 1. A370137

Triangle of coefficients T(n,k) of polynomials p(n,x) = ∑_k=0..n T(n,k)*x^k where T(0,0) = 1, and T(n,k) = 0 for k < 0 or k > n, and T(n,k) = T(n-1,k-1) + (2·n-1+k)*T(n-1,k) for n > 0 and 0 <= k <= n. A265649