Properties of the Number 4232

Four Thousand Two Hundred Thirty-Two

Basics

Value: 4231 → 4232 → 4233

Parity: even

Prime: No

Previous Prime: 4231

Next Prime: 4241

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 23 ²

Divisors: 1, 2, 4, 8, 23, 46, 92, 184, 529, 1058

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000010001000

Octal: 10210

Duodecimal: 2548

Hexadecimal: 1088

Square: 17909824

Square Root: 65.05382386916237

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) = 2·n². A1105

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

a(0) = 0 and then alternately even and odd numbers in increasing order such that the sum of any two successive terms is a square. A77221

a(n) = 8·n². A139098

Numbers of the form p² * q³, where p,q are distinct primes. A143610

Numbers m with the property that the symmetric representation of σ(m) has three parts of width one. A247687

Number of partitions of n in which the sequence of the sum of the same summands is nondecreasing. A304405

Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261719

Numbers n such that Bernoulli number B_n has denominator 1410. A272369

a(n) is the least k such that sopfr(k) - sopf(k) = n. A280286