Properties of the Number 3155

Three Thousand One Hundred Fifty-Five

Basics

Value: 3154 → 3155 → 3156

Parity: odd

Prime: No

Previous Prime: 3137

Next Prime: 3163

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 631

Divisors: 1, 5, 631, 3155

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110001010011

Octal: 6123

Duodecimal: 19AB

Hexadecimal: c53

Square: 9954025

Square Root: 56.16938667993447

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

Mian-Chowla sequence (a B₂ sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct. A5282

Sums of distinct powers of 5. A33042

REVEGF transform of [1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...]. A53492

Powers of cube root of 3 rounded up. A17984

Number of integer partitions of n with as many even parts as even conjugate parts. A350948

Powers of cube root of 9 rounded up. A18002

Array read by antidiagonals: T(n,k) = number of barred preferential arrangements of k things with n bars (k >=0, n >= 0). A226513

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,-2 or 0,2. A264313

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 3,3,1,1,0 for x=0,1,2,3,4. A197350

Number of partitions of n such that the number of odd parts is a part and the number of even parts is not a part. A240578