5395
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 1661
- 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
- 3936
- Möbius Function
- -1
- Radical
- 5395
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 160
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n^2.at n=21A000604
- Coordination sequence T3 for Zeolite Code NES.at n=47A008207
- a(n) = (n+1)*(n^2 +8*n +6)/6. Number of n-dimensional partitions of 4. Number of terms in 4th derivative of a function composed with itself n times.at n=29A008778
- Expansion of 1/((1-2x)(1-10x)(1-11x)).at n=3A016325
- Numbers k such that k divides the (left) concatenation of all numbers <= k written in base 24 (most significant digit on right and removing all least significant zeros before concatenation).at n=9A029541
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 13 ones.at n=13A031781
- Maximum number of trapezoids that can be formed by n lines in plane.at n=18A037984
- a(n) = floor(a(n-1)*3/2) with a(1) = 2.at n=20A061418
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=9A064687
- a(n) is the smallest positive integer such that no term in S={a(1),...,a(n)}, n>=3, divides the sum of any two other distinct terms of S, after first initializing the sequence with a(1)=3 and a(2)=4.at n=33A068573
- Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.at n=18A079053
- Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=9A089549
- Numbers n such that 7*10^n-3 is prime.at n=16A103049
- Number of permutations of length n which avoid the patterns 1234, 1243, 3421.at n=9A116762
- Number of n X n nonnegative integer arrays with every 2 X 2 subblock summing to 4.at n=3A145014
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=10A148058
- Triangle read by rows: T(n,m) = (-1)^n*Sum_{i=0..m} (-1)^(m-i)*binomial(n-i-1, m-i)*Stirling_1(n+i+1,i+1), for 0 <= m <= n.at n=13A156528
- a(n) = ceiling(A173510(n)/2).at n=35A173513
- Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares not greater than n*12/3.at n=21A183921
- Inverse permutation to A190126.at n=22A190127