Properties of the Number 3129

Three Thousand One Hundred Twenty-Nine

Basics

Value: 3128 → 3129 → 3130

Parity: odd

Prime: No

Previous Prime: 3121

Next Prime: 3137

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 149

Divisors: 1, 3, 7, 21, 149, 447, 1043, 3129

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000111001

Octal: 6071

Duodecimal: 1989

Hexadecimal: c39

Square: 9790641

Square Root: 55.937465083787984

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

Total size of all principal order ideals in the poset of integer partitions of n with the refinement order. A265947

Numbers that are the sum of 5 positive 5th powers. A3350

Interprimes (A024675) which are of the form s·prime, s=21. A75296

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

If decimal expansion of n is ab...d, a(n) = a^a + b^b +...+ d^d. A45503

a(n) = ∑_k=1..n gcd(n,k)ⁿ. A332517

T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus twice the median plus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero. A251428

Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = ∑_j=1..n gcd(j, n)^k. A343510

Numbers that can be written as s^x + t^y, with 1 < s < t and {s,t} = {x,y}; that is, are of the form s^s + t^t or s^t + t^s. A385232

Numbers n such that Q(sqrt(n)) has class number 10. A218042