5047
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5928
- Proper Divisor Sum (Aliquot Sum)
- 881
- 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
- 4284
- Möbius Function
- 0
- Radical
- 721
- Omega Function (Ω)
- 3
- 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
- 134
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n + n*(n-1)*(n-2)*(n-3)*(n-4)*(n-5).at n=7A001096
- a(n) = n! + n.at n=7A005095
- Somos-6 sequence: a(n) = (a(n-1) * a(n-5) + a(n-2) * a(n-4) + a(n-3)^2) / a(n-6), a(0) = ... = a(5) = 1.at n=13A006722
- Coordination sequence T1 for Zeolite Code NON.at n=43A008212
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A000032 (Lucas numbers).at n=13A023861
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=31A024838
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (Lucas numbers).at n=12A024858
- a(n) = (d(n)-r(n))/5, where d = A026060 and r is the periodic sequence with fundamental period (0,0,1,4,0).at n=44A026062
- a(n) = n*(2*n+5).at n=49A033537
- Number of partitions of n into parts not of form 4k+2, 12k, 12k+5 or 12k-5.at n=52A036019
- Has both a primitive and imprimitive representation as x^2 + xy + y^2.at n=36A045897
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=32A049454
- a(n) = solution to the postage stamp problem with 7 denominations and n stamps.at n=9A053346
- Numbers n such that n | 7^n + 6^n + 1.at n=15A057298
- McKay-Thompson series of class 39C for Monster.at n=40A058661
- Numerator of 1/F(1) + 1/F(2) + 1/F(3) + ... + 1/F(n), where F(n) is the n-th Fibonacci number (A000045).at n=6A059248
- Sums of nonconsecutive factorial numbers.at n=25A060112
- Positions of the permutations which have the same rank in A055089 and A060118, i.e., the fixed points of permutations A060120 and A060127.at n=39A060133
- Smallest of 4 consecutive numbers each divisible by a square.at n=12A070284
- a(n) = solution to the postage stamp problem with n denominations and 10 stamps.at n=6A075060