Properties of the Number 32755

Thirty-Two Thousand Seven Hundred Fifty-Five

Basics

Value: 32754 → 32755 → 32756

Parity: odd

Prime: No

Previous Prime: 32749

Next Prime: 32771

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 6551

Divisors: 1, 5, 6551, 32755

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111111110011

Octal: 77763

Duodecimal: 16B57

Hexadecimal: 7ff3

Square: 1072890025

Square Root: 180.9834246554087

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

Numbers missing from A102370. A102371

At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage. A64412

Sum of solutions of φ(x) = 2ⁿ. A58214

a(n) = 2ⁿ⁺¹ - n + 1. A132753

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 561", based on the 5-celled von Neumann neighborhood. A289377

Decimal representation of the n-th iteration of the "Rule 213" elementary cellular automaton starting with a single ON (black) cell. A267802

a(n) = k where wt(k) = n and k + wt(k) = a power of two, where wt(n) = A000120(n) = binary weight of n. A374348

a(n) = the least positive integer k such that ω(n+k) = ω(k)+n, where ω(m) (A001222) denotes the number of prime factors of m, counting multiplicity. A76158

a(n) = 6*(2·n+1)! / ((n!)²*(n+3)). A7946

Palindromic Super-7 Numbers. A32755