Properties of the Number -60615

Sixty Thousand Six Hundred Fifteen

Basics

Value: -60616 → -60615 → -60614

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 449

Divisors: 1, 3, 5, 9, 15, 27, 45, 135, 449, 1347

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1110110011000111

Octal: -166307

Duodecimal: -2B0B3

Hexadecimal: -ecc7

Square: 3674178225

Square Root: 246.201137284132

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

Let S denote the palindromes in the language {0,1,2}*; a(n) = number of words of length n in the language SS. A7056

Least positive integer m relatively prime to n such that σ(m·n) is a fourth power, where σ(k) is the sum of the divisors of k. A334353

Irregular triangle read by rows. For each j, 1<=j<=n properly color the vertices of a labeled graph on [n] using each of the first j colors in the color set {c1<c2<...<cn}. Orient the edges according to the strict order on the colors. T(n,k) is the number of such directed graphs containing k descents, n>=0, 0<=k<=binomial(n,2). A381102

Numbers k such that 245·2^k+1 is prime. A32499

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, -1), (0, 1, 1), (1, -1, -1)}. A148537