Properties of the Number 3048

Three Thousand Forty-Eight

Basics

Value: 3047 → 3048 → 3049

Parity: even

Prime: No

Previous Prime: 3041

Next Prime: 3049

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 127

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 127, 254

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 101111101000

Octal: 5750

Duodecimal: 1920

Hexadecimal: be8

Square: 9290304

Square Root: 55.20869496736904

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

Numbers that are the sum of 10 positive 6th powers. A3366

Number of undirected Knight's tours on a 3 X n board. A169696

Numbers that can be expressed as the difference of the squares of primes in just two distinct ways. A90788

Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of distinct parts, i.e., that are not the multiset union of any set of edges. A339559

T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences. A200204

Positive integers n such that n¹³ + 1 is semiprime. A105237

Numbers k such that k divides 1 + ∑_j=1..k prime(j)⁵ = 1 + A122103(k). A128169

Numbers k such that σ(x) = k has exactly 4 solutions. A60660

Number T(n,k) of isoscent sequences of length n with exactly k ascents; triangle T(n,k), n>=0, 0<=k<=n+3-ceiling(2·sqrt(n+2)), read by rows. A242351

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302081