Properties of the Number -3267

Two Hundred Sixty-Seven

Basics

Value: -3268 → -3267 → -3266

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 11 ²

Divisors: 1, 3, 9, 11, 27, 33, 99, 121, 297, 363

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110011000011

Octal: -6303

Duodecimal: -1A83

Hexadecimal: -cc3

Square: 10673289

Square Root: 57.15767664977295

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) = -(n + 1)*(2·n² + n - 12)/6. A58372

Discriminant of the pure cubic field Q(m^1/3), where m = A004709(n) is the n-th cubefree number. A242867

Values of n such that L(7) and N(7) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A226927

a(n) = 3·n². A33428

Number of (w,x,y) such that w,x,y are all in {0,...,n} and |w-x| = |x-y|. A212959

Achilles numbers - powerful but imperfect: if n = Product(p_i^e_i) then all e_i > 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power. A52486

Numbers n such that n = product (p_k)^c_k and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0. A88902

Number of set partitions of strict integer partitions of n that have distinct block-sums. A279375

Double-bitters: only even length runs in binary expansion. A1196

Number of integer partitions of n whose differences (with the last part taken to be 0) are distinct. A325324