5919
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7896
- Proper Divisor Sum (Aliquot Sum)
- 1977
- 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
- 3944
- Möbius Function
- 1
- Radical
- 5919
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 173
- 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
- n is equal to the number of 3s in all numbers <= n written in base 5.at n=9A014895
- 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 25.at n=26A031523
- Multiplicity of highest weight (or singular) vectors associated with character chi_92 of Monster module.at n=37A034480
- Smallest number that takes n steps to reach 0 under "k->max product of 2 numbers whose concatenation is k".at n=17A035932
- Smallest number that can be made to take n steps to reach 0 under "k -> any product of 2 numbers whose concatenation is k".at n=18A035934
- Hexagonal cata-condensed helicenes with n cells (non-planar cata-fused benzenoid hydrocarbons).at n=10A038143
- a(1) = 6; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A046256
- A simple grammar.at n=9A052853
- Engel series expansion (or "Egyptian product") for Catalan's constant G.at n=15A054543
- a(n) = T(n,n-3), array T as in A055818.at n=29A055820
- a(n) = round(126*phi^n).at n=20A080074
- Number array whose rows are the series reversions of x(1-x)/(1+x)^k, read by antidiagonals.at n=49A107111
- G.f.: A(x) = exp( Sum_{n>=1} A056045(n)/n*x^n ), where A056045(n) = Sum_{d|n} binomial(n,d).at n=17A110448
- a(n) = prime(n)*prime(n+1) + prime(n) + prime(n+1).at n=20A126199
- Number of 3's in the last section of the set of partitions of n.at n=37A182713
- G.f. A(x) satisfies: A(x - A(x)^2) = x/(1-x).at n=5A185897
- Numbers n such that n^2 + 2*n + 2^n is prime.at n=17A188574
- The 180-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=22A244806
- Fibonacci-Zumkeller numbers: a(n)=n if n<=3, otherwise the smallest number >= a(n-2) + a(n-1) having at least one common factor with a(n-2), but none with a(n-1).at n=16A249357
- a(n) = (1/n)*Sum_{k=0..n-1} A001850(k)*A245769(k).at n=4A268137