2831
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3000
- Proper Divisor Sum (Aliquot Sum)
- 169
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2664
- Möbius Function
- 1
- Radical
- 2831
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 35
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of interval orders constructed from n intervals of generic lengths.at n=4A000763
- Numbers that are the sum of 10 positive 7th powers.at n=16A003377
- Positions of remoteness 6 in Beans-Don't-Talk.at n=35A005694
- Number of permutations that are 2 "block reversals" away from 12...n.at n=9A007972
- Coordination sequence T2 for Zeolite Code AFY.at n=44A008030
- Coordination sequence T2 for Moganite, also for BGB1.at n=34A008259
- Largest convex area that can be tiled with n equilateral triangles whose sides s_k are relatively prime, i.e., gcd(s_1,...,s_n) = 1.at n=13A014529
- Powers of fourth root of 18 rounded down.at n=11A018096
- Powers of fourth root of 18 rounded to nearest integer.at n=11A018097
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=28A024932
- a(n) = [ Sum{(sqrt(j+1)-sqrt(i+1))^2} ], 1 <= i < j <= n.at n=37A025222
- Concatenation of n and n + 3.at n=27A032608
- Expansion of sum ( q^n / product( 1-q^k, k=1..5*n), n=0..inf ).at n=22A035297
- Number of partitions satisfying (cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=36A036803
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).at n=70A036876
- Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5).at n=10A036887
- Denominators of continued fraction convergents to sqrt(984).at n=9A042905
- Numbers k such that the string 8,5 occurs in the base 9 representation of k but not of k-1.at n=37A044328
- Numbers n such that string 3,1 occurs in the base 10 representation of n but not of n-1.at n=31A044363
- Numbers n such that string 8,5 occurs in the base 9 representation of n but not of n+1.at n=37A044709