Properties of the Number 5235

Five Thousand Two Hundred Thirty-Five

Basics

Value: 5234 → 5235 → 5236

Parity: odd

Prime: No

Previous Prime: 5233

Next Prime: 5237

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 349

Divisors: 1, 3, 5, 15, 349, 1047, 1745, 5235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1010001110011

Octal: 12163

Duodecimal: 3043

Hexadecimal: 1473

Square: 27405225

Square Root: 72.35329985563892

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 whose binary expansion generates rotationally symmetric XOR-triangles. A334556

Number of partitions p of n such that (number of distinct parts of p) <= max(p) - min(p). A239955

Positive numbers whose product of digits is 10 times their sum. A62043

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

T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal, vertical and antidiagonal neighbors. A231544

Numbers that are the sum of ten fourth powers in exactly five ways. A345857

Numbers n such that A068340(n) = +-1. A76542

Number of integer partitions of n with a unique non-co-mode. A363129

Deficiency of prime-shifted squares: a(n) = 2·A003961(n²) - σ(A003961(n²)), where A003961 is fully multiplicative function with a(prime(i)) = prime(i+1). A378231

T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k·n such that x(j) divides x(k) if j divides k. A180383