Properties of the Number -33153

Thirty-Three Thousand One Hundred Fifty-Three

Basics

Value: -33154 → -33153 → -33152

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 43 × 257

Divisors: 1, 3, 43, 129, 257, 771, 11051, 33153

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1000000110000001

Octal: -100601

Duodecimal: -17229

Hexadecimal: -8181

Square: 1099121409

Square Root: 182.07965289949342

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

Centered icosahedral (or cuboctahedral) numbers, also crystal ball sequence for f.c.c. lattice. A5902

Euler pseudoprimes: composite numbers n such that 2^(n-1/2) == +-1 (mod n). A6970

Euler-Jacobi pseudoprimes: 2^(n-1/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol. A47713

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

The (2ⁿ+1)-th triangular number (cf. A000217). A28401

Sarrus numbers A001567 that are not Carmichael numbers A002997. A153508

Sum of the squarefree parts of the partitions of n into 6 parts. A309481

Triangular numbers with only odd digits. A117960

Triangular numbers that are binary palindromes. A350987

Composite numbers k == 1 (mod 4) such that (1 + i)^k == 1 + i (mod k), where i = sqrt(-1). A270698