5594
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8394
- Proper Divisor Sum (Aliquot Sum)
- 2800
- 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
- 2796
- Möbius Function
- 1
- Radical
- 5594
- 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
- 67
- 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
- yes
- Odd
- no
Appears in sequences
- Number of blobs with 2n+1 edges.at n=6A003168
- Coordination sequence T1 for Zeolite Code FER.at n=46A008106
- Numbers k such that the continued fraction for sqrt(k) has period 41.at n=12A020380
- Convolution of (1, p(1), p(2), ...) and (F(2), F(3), F(4), ...).at n=13A023628
- a(n) = floor(n^3 / Pi).at n=26A032633
- Numbers whose base-5 representation contains exactly three 3's and two 4's.at n=13A045306
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.at n=39A067356
- a(n) = (a(n-1)+a(n-2))/7^k, where 7^k is the highest power of 7 dividing a(n-1)+a(n-2).at n=50A078414
- Partial sums of A102540 (primes that are not Chen primes).at n=24A115606
- The n-th prime minus n gives a triangular number.at n=46A115883
- Row sums of triangle A134237.at n=47A134238
- Number of partitions of n into parts which are not digits of n in decimal representation.at n=45A136460
- a(n) = Sum_{k=0..n} binomial(floor(n-2k/3), k).at n=17A137402
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peaks in their peak plateaux (0<=k<=n-1). A peak plateau is a run of consecutive peaks that is preceded by an upstep and followed by a down step; a peak consists of an upstep followed by a downstep.at n=48A143953
- Number of partitions of n such that the number of parts is divisible by the greatest part. Also number of partitions of n such that the greatest part is divisible by the number of parts.at n=42A168659
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=41A181881
- Number of partitions of n minus the number of primes <= n.at n=29A183151
- Expansion of x * phi(x) * psi(x^14) / (f(-x) * f(-x^7)) in powers of x where phi(), psi(), f() are Ramanujan theta functions.at n=24A193883
- Last occurrence of n partitions in A205617.at n=17A205618
- Number of n X n 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207934