Properties of the Number 60146

Sixty Thousand One Hundred Forty-Six

Basics

Value: 60145 → 60146 → 60147

Parity: even

Prime: No

Previous Prime: 60139

Next Prime: 60149

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 29 × 61

Divisors: 1, 2, 17, 29, 34, 58, 61, 122, 493, 986

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110101011110010

Octal: 165362

Duodecimal: 2A982

Hexadecimal: eaf2

Square: 3617541316

Square Root: 245.246814454337

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

A051838 gives numbers m such that the sum of first m primes divides the product of the first m primes. This sequence gives corresponding values of the sum of first m primes. A140763

Number of n-step walks on square lattice. A2900

Expansion of (1-x)/(1 - 3·x - x² + 2·x³). A52911

Total element sum of all n X n Tesler matrices of nonnegative integers. A259787

Numbers k not ending in zero that are a substring of k*(k+1). A305670

Numbers in A007504 such that ω(a(n)) = ω(a(n)) = 4. A264887

Number of n X 5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 5 array. A219499

11-gonal numbers which are products of four distinct primes. A354086

Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n. A60146