Properties of the Number 40698

Forty Thousand Six Hundred Ninety-Eight

Basics

Value: 40697 → 40698 → 40699

Parity: even

Prime: No

Previous Prime: 40697

Next Prime: 40699

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 17 × 19

Divisors: 1, 2, 3, 6, 7, 9, 14, 17, 18, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001111011111010

Octal: 117372

Duodecimal: 1B676

Hexadecimal: 9efa

Square: 1656327204

Square Root: 201.73745314145313

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

Triangle T(n,k), 0 <= k <= n, read by rows defined by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 4·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + 5·T(n-1,k) + T(n-1,k+1) for k >= 1. A126331

Expansion of (1-4·x)^9/2. A2424

Number of partitions p of n such that (sum of parts with multiplicity 1) <= (sum of all other parts). A240449

Number of ways 2·n-1 people can vote on three candidates so that the Condorcet paradox arises. A277935

a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon). A335783

Convolution of A008805 (triangular numbers repeated) with itself. A177747

T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157. A50163

Expansion of (1-4·x)^21/2. A20933

a(n) = T(2n,n-1), where T is defined in A026022. A26030

Number of primitive (period n) periodic palindromes using a maximum of four different symbols. A56495