Properties of the Number 40140

Forty Thousand One Hundred Forty

Basics

Value: 40139 → 40140 → 40141

Parity: even

Prime: No

Previous Prime: 40129

Next Prime: 40151

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 223

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110011001100

Octal: 116314

Duodecimal: 1B290

Hexadecimal: 9ccc

Square: 1611219600

Square Root: 200.349694284768

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 T(n,k) of endofunctions on [n] such that at least one preimage with cardinality k exists and, if j is the largest value with a nonempty preimage, the preimage cardinality of i is >=k for all i<=j and equal to k for at least one i<=j; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A245733

Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=9. A135194

a(n) = 9·binomial(2·n,n)² - 8·binomial(3·n,n). A357568

Concatenations x||1||x for numbers x. A392225

Triangle with first column identical to 1 and the other entries defined by the sum of entries above and to the left. A226392

Number of preferential arrangements of n labeled elements such that the minimal number of elements per rank equals 2. A245855

a(n) is the least number with exactly n prime factors, counted with multiplicity, that is the concatenation of x, 1, and·for some x. A392239

Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array. A219774

a(n) = p(2·n)-p(2·n-2)-p(n) where p(n) are the partition numbers A000041(n). A263847

Vinogradov's number J_3,2(n). A281391