5373
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
- 8
- Divisor Sum
- 8000
- Proper Divisor Sum (Aliquot Sum)
- 2627
- 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
- 3564
- Möbius Function
- 0
- Radical
- 597
- Omega Function (Ω)
- 4
- 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
- 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
- Generalized Catalan numbers: a(n+1) = a(n) + Sum_{k=1..n-1} a(k)*a(n-1-k).at n=13A004148
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=27A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=27A004946
- a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.at n=17A006053
- Sum of gcd(x, y) for 1 <= x, y <= n.at n=44A018806
- Numbers whose sum of divisors is a cube.at n=29A020477
- Essentially same as A004148.at n=14A025241
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=33A045127
- Number of partitions of n into distinct parts with 2 levels of parentheses.at n=14A050343
- Numbers n such that n | 11^n + 10^n.at n=47A057493
- Numbers k such that 5*2^k - 3 is prime.at n=39A058588
- Numerators of coefficients in series expansion of -512*(1+x)^3/(x-8)^3.at n=5A066414
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 18.at n=27A066697
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).at n=9A074356
- Diagonal in array of n-gonal numbers A081422.at n=17A081435
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 7 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.at n=7A094789
- a(n) = A004001(10^n).at n=4A095900
- Sequence generated from Golomb's proof of de Bruijn's theorem on a torus considered as a matrix.at n=3A095905
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)).at n=49A097860
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k valleys (n>=0, 0<=k<=floor(n/2)-1; a valley is a downstep followed by an upstep).at n=32A097885