Properties of the Number 40257

Forty Thousand Two Hundred Fifty-Seven

Basics

Value: 40256 → 40257 → 40258

Parity: odd

Prime: No

Previous Prime: 40253

Next Prime: 40277

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 7 × 71

Divisors: 1, 3, 7, 9, 21, 27, 63, 71, 81, 189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110101000001

Octal: 116501

Duodecimal: 1B369

Hexadecimal: 9d41

Square: 1620626049

Square Root: 200.64147128647159

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 intersections of diagonals in the interior of a regular n-gon. A6561

Iterates of A234742, starting from value a(0) = 1361, with a(1) = A234742(a(0)), a(2) = A234742(a(1)), etc. A260441

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

The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2ⁿ)*(2ⁿ+1)/2, the 2ⁿ -th triangular number. Sequence contains the triangle read by rows. A112358

E.g.f. A(x) satisfies: A(x) = 1 + x·exp(Integral A(x)² dx). A143922

Numbers m such that both m²-1 and m² are refactorable numbers (A033950) and that m² has more divisors than m²-1. A342970

Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square. A194196

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 0, 1)}. A148732

Continued fraction for sqrt(274). A40257