Properties of the Number 60495

Sixty Thousand Four Hundred Ninety-Five

Basics

Value: 60494 → 60495 → 60496

Parity: odd

Prime: No

Previous Prime: 60493

Next Prime: 60497

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 37 × 109

Divisors: 1, 3, 5, 15, 37, 109, 111, 185, 327, 545

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110110001001111

Octal: 166117

Duodecimal: 2B013

Hexadecimal: ec4f

Square: 3659645025

Square Root: 245.95731336961705

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

a(n) = (7·n³ + 6·n² + 5·n) / 6. A101165

a(n) = (1/5)*A290909(n), n>= 0. A290910

Numbers k such that A353802(k) / σ(σ(k)) is an integer > 1, where A353802(n) = ∏_p^e||n σ(σ(p^e)). A353807

Solution of the complementary equation a(n) = 3·a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences. A295139

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) - 1, where a(0) = 2, a(1) = 4, b(0) = 1, b(1) = 3, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295961

Partial sums of A102659 read as decimal integers. A135255

Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap. A60495

Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. A207469