5947
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6280
- Proper Divisor Sum (Aliquot Sum)
- 333
- 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
- 5616
- Möbius Function
- 1
- Radical
- 5947
- 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
- 142
- 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
- Numbers k such that 5*2^k + 1 is prime.at n=14A002254
- Multiplicity of highest weight (or singular) vectors associated with character chi_10 of Monster module.at n=38A034398
- The sequence e when b=[ 1,1,1,0,1,1,... ].at n=54A042957
- Numbers whose base-5 representation contains exactly three 2's and two 4's.at n=17A045291
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=16A049891
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=30A064907
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the first term of each group.at n=46A074125
- a(n+1) = floor(a(n) * Sum_{k=0..n} 1/a(k)^s), where s = Sum_{k>=0} 1/a(k)^s and a(0)=1; s = 2.260568736857767...at n=12A080135
- a(1)=1, a(n)=2*a(n-1)+1 if that number is composite, a(n)=a(n-1)+1 otherwise.at n=19A081871
- Partial sums of A000219.at n=13A091360
- Greatest number, not divisible by 4, having exactly n partitions into three distinct positive squares.at n=2A096021
- Convolution of generalized Catalan numbers A064062 (called C(n;2)).at n=6A115197
- Row sums of triangle A131424.at n=31A131425
- Zero-less composite numbers such that exactly eight distinct anagrams are primes.at n=37A163651
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=7A186488
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=8A186488
- T(n,m)=Number of (n+1)X4 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=22A188058
- T(n,m)=Number of (n+1)X3 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=30A190023
- Values of n such that L(15) and N(15) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=56A227518
- Number of (n+2) X (2+2) 0..3 arrays with no element unequal to a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=9A231435