5339
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5640
- Proper Divisor Sum (Aliquot Sum)
- 301
- 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
- 5040
- Möbius Function
- 1
- Radical
- 5339
- Omega Function (Ω)
- 2
- 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
- 46
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Total number of fixed points in planted trees with n nodes.at n=15A005202
- a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).at n=45A016085
- a(n) = integer nearest a(n-1)/(sqrt(6) - 2), where a(0) = 1.at n=11A024562
- Number of partitions of n that do not contain 5 as a part.at n=32A027339
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 73.at n=1A031571
- Number of partitions of n into parts 3k and 3k+1 with at least one part of each type.at n=43A035618
- Number of partitions satisfying cn(0,5) + cn(2,5) <= 1 and cn(0,5) + cn(3,5) <= 1.at n=44A039851
- Numbers having three 3's in base 8.at n=30A043435
- Numbers n such that sigma(n+1)=3*phi(n).at n=50A067261
- a(1)=1. a(n) = a(n-1) + sum of the squares which are among the first (n-1) terms of the sequence.at n=26A101135
- Shadow of N (natural numbers), also of Champernowne's shadow.at n=34A110623
- Prime(n)^2*prime(n+1)...*prime(a(n)) is the least product of consecutive primes which is abundant. Note that only the first term is squared.at n=47A126105
- Triangle read by rows: T(n,k) gives number of connected graphs on n nodes with clique number n-k, (n>=2, k=0..n-2).at n=26A126744
- Number of connected graphs on n nodes with clique number 3.at n=7A126745
- Number of lines through at least 2 points of a 7 X n grid of points.at n=22A160847
- Numbers k such that 6*k + 7 = p^2 (p=prime).at n=38A171140
- Sequence by greedy construction satisfying Lucier-Sárközy difference set condition.at n=40A174911
- Number of nondecreasing arrangements of 9 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=38A189332
- Number of zero-sum -1..1 arrays of n elements with first through third differences also in -1..1.at n=26A202504
- Number of partitions of n such that 2*(greatest part) = (number of parts).at n=51A237753