2140
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4536
- Proper Divisor Sum (Aliquot Sum)
- 2396
- 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
- 848
- Möbius Function
- 0
- Radical
- 1070
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 24
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)).at n=46A001304
- "Magic" integers: a(n+1) is the smallest integer m such that there is no overlap between the sets {m, m-a(i), m+a(i): 1 <= i <= n} and {a(i), a(i)-a(j), a(i)+a(j): 1 <= j < i <= n}.at n=28A004210
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=39A007209
- Coordination sequence T3 for Zeolite Code DDR.at n=29A008073
- Coordination sequence T2 for Zeolite Code NAT.at n=31A008204
- Coordination sequence T1 for Zeolite Code CZP.at n=30A019456
- Numbers k such that the continued fraction for sqrt(k) has period 28.at n=39A020367
- Base 6 expansion uses each positive digit just once.at n=10A023744
- Expansion of (theta_3(z)*theta_3(15z) + theta_2(z)*theta_2(15z))^3.at n=30A028627
- Numbers having period-3 7-digitized sequences.at n=38A031203
- 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 22.at n=37A031520
- a(n) = floor ( n(n+1)(n+2)(n+3) / (n+(n+1)+(n+2)+(n+3)) ).at n=19A032767
- Number of partitions of n into parts 4k+1 and 4k+3 with at least one part of each type.at n=45A035625
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=33A036000
- Numerators of continued fraction convergents to sqrt(698).at n=7A042342
- Numbers k such that string 3,4 occurs in the base 8 representation of k but not of k-1.at n=37A044215
- Numbers n such that string 3,7 occurs in the base 9 representation of n but not of n-1.at n=29A044285
- Numbers n such that string 1,4 occurs in the base 10 representation of n but not of n-1.at n=24A044346
- Numbers n such that string 4,0 occurs in the base 10 representation of n but not of n-1.at n=23A044372
- Numbers n such that string 3,4 occurs in the base 8 representation of n but not of n+1.at n=37A044596