5095
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
- 4
- Divisor Sum
- 6120
- Proper Divisor Sum (Aliquot Sum)
- 1025
- 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
- 4072
- Möbius Function
- 1
- Radical
- 5095
- 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
- 72
- 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
- Parker's partition triangle T(n,k) read by rows (n >= 1 and 0 <= k <= n-1).at n=50A047812
- Odd values arising in A066820.at n=3A066852
- a(n)=phi(n^2+1)/n if (n^2+1) is composite and phi(n^2+1)==0 (mod n).at n=21A067926
- Smallest integer >= 0 of the form x^3 - n^4.at n=32A070930
- Triangle read by rows giving numbers of paths in a lattice satisfying certain conditions.at n=61A071944
- a(n) = A072637(A048679(n)).at n=21A072647
- Numerators of sequence of fractions defined by a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)+a(n-2)+1)/a(n-2).at n=9A076842
- Least non-balanced x (i.e., not in A020492) such that sigma(p(n),x)/phi(x) is an integer, where p(n) = n-th prime.at n=30A078540
- Least k such that the distance from k^2 to closest prime = n or zero if no k exists.at n=41A079666
- A014486-indices of binary trees whose left and right subtree are identical.at n=15A083938
- Semiprime function n -> A001358(n) applied four times to n.at n=42A105998
- Triangle in A071944 with rows reversed.at n=59A108074
- Number of permutations of length n which avoid the patterns 1234, 2143, 2431.at n=8A116807
- a(n) = 2*3^n + 3^(n-1) - (n+1).at n=6A133648
- Transpose T(n,k) of Parker's partition triangle A047812 (n >= 1 and 0 <= k <= n-1).at n=49A136621
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 5 and 9.at n=38A136826
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 9.at n=31A136891
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 9.at n=33A136901
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=19A136914
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 9.at n=21A136917