5409
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7826
- Proper Divisor Sum (Aliquot Sum)
- 2417
- 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
- 3600
- Möbius Function
- 0
- Radical
- 1803
- 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
- 116
- 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
- Coordination sequence T1 for Zeolite Code MTT.at n=45A008189
- Numbers k such that the continued fraction for sqrt(k) has period 58.at n=36A020397
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=44A023180
- a(n) = least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 3rd elementary symmetric function.at n=27A027917
- Gaps of 7 in sequence A038593 (upper terms).at n=20A038654
- Gaps of 10 in sequence A038593 (lower terms).at n=4A038659
- Numbers ending with '9' that are the difference of two positive cubes.at n=21A038864
- a(n) = (n+3)^3 - n^3.at n=22A038865
- Sum of the first n palindromes (A002113).at n=40A046489
- Smallest of four consecutive integers divisible by four consecutive primes respectively.at n=32A072555
- a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=41A074344
- Left side of the triangle A075652.at n=49A075648
- Third row of Pascal-(1,3,1) array A081578.at n=26A081585
- Expansion of (1-x)/((1-2*x)*(1-x-x^3)).at n=12A099568
- Numbers n such that n and its digit reversal both are difference of (positive or negative) cubes.at n=49A104339
- Numbers n such that n and its digit reversal R(n) both are difference of positive cubes.at n=11A109879
- A sequence related to M-partitions.at n=47A117117
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...).at n=22A124574
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=43A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=29A125756