Properties of the Number 1235

One Thousand Two Hundred Thirty-Five

Basics

Value: 1234 → 1235 → 1236

Parity: odd

Prime: No

Previous Prime: 1231

Next Prime: 1237

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 5 × 13 × 19

Divisors: 1, 5, 13, 19, 65, 95, 247, 1235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011010011

Octal: 2323

Duodecimal: 86B

Hexadecimal: 4d3

Square: 1525225

Square Root: 35.14256678161116

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

Number of partitions of n such that no part is a sum of two or more other parts. A237667

Triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k parts p at position p (fixed points), n>=0, 0<=k<=n. A238349

T(n,m) = number of 1..m integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171275

Number of maximal subsets of {1..n} such that it is possible to choose a different prime factor of each element. A370585

Number of compositions p(1)+p(2)+...+p(k) = n such that for no part p(i) = i (compositions without fixed points). A238351

Primitively primeshift-abundant numbers: Numbers that are included in A246282 (k with A003961(k) > 2k), but none of whose proper divisors are. A337372

Numbers k such that the decimal expansions of both k and k² have 1 as smallest digit and 5 as largest digit. A256889

a(n+3) = -a(n+2) + 2a(n+1) + a(n) with a(0)=-1, a(1)=0, a(2)=-3. A214683

Numbers h such that h and h-1 have same antiharmonic mean of the numbers k < h such that gcd(k, h) = 1 and simultaneously this mean is an integer (see A179882). A179878

Triangle T(n,k) read by rows: T(n,k) is the number of compositions of n with k parts p at position p (fixed points), n>=0, 0<=k<=A003056(n). A238350