Properties of the Number -13757

Thirteen Thousand Seven Hundred Fifty-Seven

Basics

Value: -13758 → -13757 → -13756

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 13757

Divisors: 1, 13757

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11010110111101

Octal: -32675

Duodecimal: -7B65

Hexadecimal: -35bd

Square: 189255049

Square Root: 117.29023829799307

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

a(n) = ∑_i=1..n (-1)ⁱ⁺¹ prime(i)², where prime(k) denotes the k-th prime: alternating sum of the squares of the first n primes. A240860

Number of n-node labeled graphs without endpoints. A59167

Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and exactly k endpoints (vertices of degree 1). A327369

a(n) = a(n-1) + ∑_k=0..n-4 a(k)*a(n-4-k), a(0) = 1. Generalized Catalan Numbers. A23426

One of the four successive approximations up to 13ⁿ for 13-adic integer 3^1/4. This is the 3 (mod 13) case (except for n = 0). A324082

Smallest prime p having n different cycles in decimal expansions of k/p, k=1..p-1. A54471

Primes at which the difference pattern X24Y (X and Y >= 6) occurs in A001223. A52163

Lesser of twin primes whose average is 6 times a prime. A60213

Prime numbers p such that x² + x + p produces primes for x = 0..2 but not x = 3. A210361

a(1) = 2. For n>1, let s denote the binary string of a(n-1) with the leftmost 1 and following consecutive 0's removed. Then a(n) is the smallest prime not yet present whose binary representation begins with s. A262350