2890
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5526
- Proper Divisor Sum (Aliquot Sum)
- 2636
- 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
- 1088
- Möbius Function
- 0
- Radical
- 170
- 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
- 48
- 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
- Numbers that are the sum of 2 squares in exactly 3 ways.at n=29A000443
- a(n) = floor(1000*log(n)).at n=17A004240
- a(n) = 1000*log(n) rounded to the nearest integer.at n=17A004241
- Number of points on surface of tetrahedron; coordination sequence for sodalite net (equals 2*n^2+2 for n > 0).at n=38A005893
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=35A007077
- Coordination sequence for body-centered tetragonal lattice.at n=19A008527
- Numbers n such that phi(n) * sigma(n) + 16 is a perfect square.at n=45A015729
- Numbers k such that k | 13^k + 1.at n=16A015963
- Numbers k such that the continued fraction for sqrt(k) has period 11.at n=27A020350
- Fibonacci sequence beginning 4, 30.at n=11A022387
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=46A024696
- a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=25A025003
- a(n) = floor( Sum_{1 <= i < j <= n} ((sqrt(j)-sqrt(i))^3) ).at n=26A025197
- Numbers that are the sum of 2 nonzero squares in exactly 3 ways.at n=27A025286
- Numbers that are the sum of 2 nonzero squares in 3 or more ways.at n=35A025294
- Numbers that are the sum of 2 distinct nonzero squares in exactly 3 ways.at n=26A025304
- Numbers that are the sum of 2 distinct nonzero squares in 3 or more ways.at n=34A025313
- Expansion of 1/((1-2x)(1-3x)(1-7x)(1-8x)).at n=3A025943
- a(n) = Sum_{i=0..n} Sum_{j=0..n} A026626(i,j).at n=10A026635
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=22A027578