5033
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 727
- 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
- 4308
- Möbius Function
- 1
- Radical
- 5033
- 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
- 90
- 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
- a(n) = n! - n.at n=7A005096
- Hammersley's polynomial p_n(1).at n=6A006846
- Coordination sequence T1 for Zeolite Code MTW.at n=46A008196
- Coordination sequence for sigma-CrFe, Position Xd.at n=18A009959
- Numbers k such that Fib(k) == 13 (mod k).at n=28A023178
- Sum{T(n,k)}, k = 0,1,...,n, where T is the array defined in A024996.at n=9A026080
- Decimal part of a(n)^(1/5) starts with reversal of its integer part: first term of runs.at n=4A034311
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=43A036807
- a(n)=T(n,1), array T as in A049735.at n=40A049744
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 5.at n=42A064903
- Triangle of numbers {a(n,k), n >= 0, 0<=k<=n} defined by a(0,0)=1, a(n,0)=A006013(n), a(n+1,n)=A001764(n+1), a(n,m) = Sum A001764(n-k)*a(n,k), k=0..m.at n=23A073148
- 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=40A078540
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=49A079024
- Triangle, read by rows, equal to the matrix inverse of A056241, which is formed from the even-indexed trinomial coefficients.at n=21A104027
- a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=10, a(2)=30.at n=23A104863
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and such that the sum of the bottom levels of all columns is k (n>=1, k>=0; informally, the number of the "missing" cells in the right bottom corner of the polyomino). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=31A122104
- G.f.: (1-2*x+2*x^2-x^3+x^4-x^5+2*x^6-2*x^7+x^8)/((1-x)^2*(1-x^2)*(1-x^3)*(1-x^6)).at n=43A127825
- Triangle T(n, k) = n*( (n-1)! - (k-1)! ), read by rows.at n=22A137259
- Triangle T(n, k) = n*( (n-1)! - (k-1)! ), read by rows.at n=21A137259
- Positions of heptagonal numbers in the EKG sequence.at n=45A140810