5219
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5544
- Proper Divisor Sum (Aliquot Sum)
- 325
- 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
- 4896
- Möbius Function
- 1
- Radical
- 5219
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AFX = SAPO-56 [Al23Si5P20O96] starting with a T1 atom.at n=5A018971
- a(n) = n*(9*n + 1)/2.at n=34A022267
- a(n) = n^3 + n^2 + n.at n=17A027444
- Numbers having period-1 7-digitized sequences.at n=28A031201
- Numbers k that divide 9^k + 8^k.at n=5A045607
- Numbers n such that 5*10^n-1 is prime.at n=11A056712
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=10A070192
- z such that the Diophantine equation x^3+y^4=z^3 has solutions.at n=38A070741
- Maximal number of zeros in a row of the character table of the symmetric group S_n.at n=29A085800
- a(n) = floor(10^n/7^n).at n=24A094992
- a(n) = 6*n*(n-1) - 1.at n=30A103115
- Semiprimes which are divisible by the sum of their digits.at n=39A118693
- Numbers n such that n together with its double and triple contain every digit.at n=41A120564
- a(n) = prime(n)^3 + prime(n)^2 + prime(n).at n=6A181149
- a(n) = -1 + n + 4*n^2.at n=36A182868
- Number of partitions of n containing a clique of size 1.at n=30A183558
- Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers), and q(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n}.at n=53A193955
- Mirror of the triangle A193955.at n=46A193956
- Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers) .at n=52A193959
- Mirror of the triangle A193959.at n=46A193960