5913
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 8954
- Proper Divisor Sum (Aliquot Sum)
- 3041
- 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
- 3888
- Möbius Function
- 0
- Radical
- 219
- Omega Function (Ω)
- 5
- 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
- 80
- 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) = Sum_{k=1..n} k!.at n=7A007489
- Coordination sequence T2 for Zeolite Code FER.at n=47A008107
- n is equal to the number of 3s in all numbers <= n written in base 5.at n=7A014895
- Numbers k such that k divides 4^k - 1.at n=33A014945
- Discriminants of quintic fields with 4 complex conjugates.at n=34A023685
- Number of partitions of n that do not contain 6 as a part.at n=32A027340
- One of the three sequences associated with the polynomial x^3 - 2.at n=12A052101
- Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.at n=35A054115
- Number of points in Z^5 of norm <= n.at n=4A055411
- Number of points in Z^n of norm <= 4.at n=5A055428
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=26A061191
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.at n=30A066697
- Sum of next n composite numbers.at n=20A072475
- Total number of right truncatable primes in base n.at n=23A076586
- Numbers n such that n#*2^n+1 is prime, where n# = product of primes <= n.at n=46A084404
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n with k cells in the first column. (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=34A100822
- Numbers n such that (273*2^n-1)^2-2 is prime.at n=40A100913
- Combinatorial triangle !n. This table read by rows gives the coefficients of general sum formulas of n-th left factorials (A003422). The k-th row (k>=1) contains T(i,k) for i=1 to 2*k and k=1 to n-2, where T(i,k) satisfies !n = n + Sum_{k=1..n-2} Sum_{i=1..2*k} T(i,k) * C(n-k-1,i).at n=42A102639
- Differences between successive permutations of 1,2,3,4,5 regarded as decimal numbers arranged in increasing order.at n=23A107346
- Expansion of x*(1-3*x-2*x^2)/(1-4*x+4*x^3+x^4).at n=10A107378