Properties of the Number 2747

Two Thousand Seven Hundred Forty-Seven

Basics

Value: 2746 → 2747 → 2748

Parity: odd

Prime: No

Previous Prime: 2741

Next Prime: 2749

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 41 × 67

Divisors: 1, 41, 67, 2747

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101010111011

Octal: 5273

Duodecimal: 170B

Hexadecimal: abb

Square: 7546009

Square Root: 52.41183072551463

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

Sum of the first n primes. A7504

Number of rucksack partitions of n: every consecutive constant subsequence has a different sum. A353864

a(n) = n*(3·n + 11)/2. A59845

Golden semiprimes: a(n)=p·q and abs(p*φ-q)<1, where φ = golden ratio = (1+sqrt(5))/2. A108540

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

Numbers n for which the third maximal prime <= sqrt(n) is the least prime divisor of n. A247394

Total area between the free polyominoes with n cells and their bounding boxes. A379628

Greatest number m such that the fractional part of (3/2)^A153663(n) >= 1-(1/m). A153667

Greatest number m such that the fractional part of (3/2)^A153664(n) >= 1-(1/m). A153668

a(n) = number of steps to reach 0 when starting from k = n³ and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261227