1904
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
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 4464
- Proper Divisor Sum (Aliquot Sum)
- 2560
- 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
- 768
- Möbius Function
- 0
- Radical
- 238
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis.at n=13A005564
- Number of strict 7th-order maximal independent sets in cycle graph.at n=50A007394
- Number of non-Abelian metacyclic groups of order p^n (p odd).at n=47A007983
- Coordination sequence T1 for Zeolite Code SGT.at n=27A008229
- Expansion of log(1+tanh(sin(x))).at n=8A009384
- Expansion of tan(sinh(x))*exp(x).at n=7A009681
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=17A011940
- Triangular array T(n,k) read by rows, where T(n,k) = coefficient of x^n*y^k in 1/(1-x-y-(x+y)^2).at n=39A016095
- Triangular array T(n,k) read by rows, where T(n,k) = coefficient of x^n*y^k in 1/(1-x-y-(x+y)^2).at n=41A016095
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(3,7).at n=8A019489
- Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(16,36).at n=6A022040
- Numbers that are the sum of 4 distinct nonzero squares in exactly 6 ways.at n=48A025381
- a(n) = sum of the numbers between the two n's in A026338.at n=45A026341
- a(0)=0, a(1)=1, a(2)=2; for n > 2, a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3).at n=11A027934
- Numbers with 20 divisors.at n=24A030638
- Numbers k such that 37*2^k+1 is prime.at n=22A032368
- Number of flat partitions of n: partitions {a_i} with each |a_i - a_{i-1}| <= 1.at n=43A034296
- Multiplicity of highest weight (or singular) vectors associated with character chi_111 of Monster module.at n=34A034499
- Number of partitions of n into parts not of the form 23k, 23k+7 or 23k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=25A035995
- Positive numbers having the same set of digits in base 7 and base 8.at n=22A037438