Properties of the Number -13055

Thirteen Thousand Fifty-Five

Basics

Value: -13056 → -13055 → -13054

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 7 × 373

Divisors: 1, 5, 7, 35, 373, 1865, 2611, 13055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001011111111

Octal: -31377

Duodecimal: -767B

Hexadecimal: -32ff

Square: 170433025

Square Root: 114.2584788976293

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) = prime(n)*(prime(n + 1) + 1) - (n³ + sum of digits of n³). A123139

A sequence of asymptotic density ζ(9) - 1, where ζ is the Riemann ζ function. A143035

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001. A260294

Triangle T(n,k) of number of chains of length k in partitions of an n-set ordered by refinement. A331955

Number of strict integer partitions of 2n not containing n. A365828

Number of odd-length integer partitions of n with a unique mode. A363726

Numbers k such that k² and k³ have the same set of digits. A29797

Sum over all partitions of n of the GCD of the number of parts and the number of distinct parts. A339312

Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_k+1, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists. A110735

a(n) = 2·a(n-1) - a(n-2) + a(n-3) + 2^n-1. A253