4140
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 8964
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1056
- Möbius Function
- 0
- Radical
- 690
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- yes
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 126
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Bell or exponential numbers: number of ways to partition a set of n labeled elements.at n=8A000110
- Number of degree-n odd permutations of order 2.at n=10A001465
- From a definite integral.at n=9A002570
- a(n) = floor(phi*a(n-2)) + a(n-1) where phi is the golden ratio.at n=14A005834
- Low-temperature series for magnetization in zero-field 3-state Potts model on cubic lattice.at n=20A007270
- Triangle a(n,k) of number of M-sequences read by antidiagonals.at n=62A007723
- Coordination sequence T3 for Zeolite Code MTN.at n=39A008188
- Theta series of A_5 lattice.at n=26A008445
- A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.at n=48A011185
- M-sequences m_0,...,m_6 with m_1 < n.at n=3A011822
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=46A011904
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=35A011971
- Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1).at n=36A011971
- Sequence formed by reading rows of triangle defined in A011971.at n=28A011972
- Number of oriented multigraphs on n labeled arcs (with loops).at n=4A020557
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 32.at n=31A031530
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=36A033306
- Triangle of coefficients of ordered cycle-index polynomials: T(n,k) = binomial(n,k)*Bell(k)*Bell(n-k).at n=44A033306
- Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).at n=35A035347
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+3 or 20k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=46A036025