Properties of the Number 3145

Three Thousand One Hundred Forty-Five

Basics

Value: 3144 → 3145 → 3146

Parity: odd

Prime: No

Previous Prime: 3137

Next Prime: 3163

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 17 × 37

Divisors: 1, 5, 17, 37, 85, 185, 629, 3145

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110001001001

Octal: 6111

Duodecimal: 19A1

Hexadecimal: c49

Square: 9891025

Square Root: 56.08029957123981

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

Partial sums of A299254. A299260

Number of integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions. A364345

Number of partitions of n for which the number of odd parts is equal to the positive alternating sum of the parts. A277103

Generalized 25-gonal (or icosipentagonal) numbers: m*(23·m - 21)/2 with m = 0, +1, -1, +2, -2, +3, -3, ... A303304

A(n,k) = ∑_d∣n φ(d)*k^n/d; square array A(n,k), n>=0, k>=0, read by antidiagonals. A185651

Numbers m that are the hypotenuse of exactly 13 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 13 ways. A97102

Number of partitions of n with rank 1 (the rank of a partition is the largest part minus the number of parts). A101198

a(0) = 0, a(1) = 1; a(n) = max { 4·a(k) + a(n-k) | 1 <= k <= n/2 }, for n > 1. A116520

Numbers k such that 11·k+1 is a square. A219257

Expansion of e.g.f. exp(arcsin(x)). A6228