5311
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5472
- Proper Divisor Sum (Aliquot Sum)
- 161
- 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
- 5152
- Möbius Function
- 1
- Radical
- 5311
- 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
- 98
- 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 written in fractional base 7/5.at n=22A024642
- 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 71.at n=23A031569
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(0,5) + cn(1,5) and cn(2,5) + cn(3,5) <= cn(0,5) + cn(4,5).at n=35A039865
- Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=10A055940
- Duplicate of A055940.at n=10A070158
- Convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n >= 0, with itself.at n=10A073371
- Numbers k such that the "inventory" A063850 of k is a perfect square.at n=9A079465
- Let P(k) = floor(k/2). Start with n, apply P repeatedly until reach 1. a(n) = concatenation of numbers obtained.at n=9A083177
- Expansion of 1 + Sum_{i>=1} (x^prime(i)/Product_{j=1..i} (1-x^j)).at n=43A095700
- Semiprimes for which both the sum and the product of the digits is also a semiprime.at n=27A118690
- Numbers k for which 16*k+1, 16*k+3 and 16*k+15 are primes.at n=26A123997
- a(n) = (n + 2)*(5*n + 1)/2.at n=45A131895
- A sequence of asymptotic density zeta(7) - 1, where zeta is the Riemann zeta function.at n=43A143033
- Ulam's spiral (SSE spoke).at n=18A143839
- Partial sums of regular primes A007703.at n=44A172289
- Semiprime centered triangular numbers.at n=23A184481
- Number of lower triangles of an (n+2) X (n+2) 0..2 array with new values introduced in row major order 0..2 and no element unequal to more than one horizontal or vertical neighbor.at n=8A194772
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.at n=5A196432
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.at n=3A196434
- T(n,k) = Number of n X k 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.at n=39A196436