5391
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
- 6
- Divisor Sum
- 7800
- Proper Divisor Sum (Aliquot Sum)
- 2409
- 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
- 3588
- Möbius Function
- 0
- Radical
- 1797
- 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
- 28
- 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
- Number of partitions into non-integral powers.at n=9A000333
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=43A023180
- Numbers k such that floor(exp(k)) is prime.at n=10A050808
- Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci Nim where the players may not take one stone.at n=35A052492
- a(n) = Sum_{d|n} d*prime(d).at n=34A061150
- Number of polyominoes with n cells that tile the plane by 180-degree rotation (Conway criterion) but not by translation.at n=10A075201
- a(n) = Sum_{i=1..n} Ulam(i), where Ulam(i) denotes the i-th Ulam number.at n=49A078663
- Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)].at n=16A095013
- Maximum number of regions defined by n zigzag-lines in the plane when a zigzag-line is defined as consisting of two parallel infinite half-lines joined by a straight line segment.at n=35A117625
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=34A120215
- Number of length n binary sequences with at most 4 of every adjacent 6 bits set.at n=13A133552
- Accepted inputs by a certain adaptive automaton (number 4258072) with two adaptive functions and unary numbers as input.at n=18A134342
- Terms in A136112 which are not in A135768.at n=45A135771
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 11110-01111 pattern in any orientation.at n=11A147506
- a(n) = 8^n + 6^n - 1.at n=4A155646
- Numbers k such that k-+1 are divisible by exactly 5 primes, counted with multiplicity.at n=40A157485
- Number of compositions of n such that the smallest part is divisible by the number of parts.at n=40A171628
- Numbers k>1 such that phi(phi(k)) = sigma(sopf(k)).at n=31A173337
- Triangle of coefficients of polynomials v(n,x) jointly generated with A208923; see the Formula section.at n=50A208908
- Number of nondecreasing sequences of n 1..5 integers with every element dividing the sequence sum.at n=43A212533