5958
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12948
- Proper Divisor Sum (Aliquot Sum)
- 6990
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1980
- Möbius Function
- 0
- Radical
- 1986
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 49
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=23A026040
- 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 76.at n=12A031574
- Number of labeled 3-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included).at n=8A059585
- Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.at n=36A062728
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 11.at n=16A068032
- Sum of first n perfect powers.at n=31A076408
- Sum of GCD's of parts in all partitions of n.at n=29A078392
- Numbers k such that 2^k + 3^(k-1) is prime.at n=41A082400
- Numbers n such that n^2+n+41 (Euler's "prime generating polynomial") is not squarefree.at n=36A097823
- Number of nonisomorphic groups with orders indexed by least prime signatures.at n=44A098887
- Integers i such that 10*i XOR 11*i = 21*i.at n=28A115829
- The (10^n)-th 4-almost prime.at n=3A120045
- "666" in bases 7 and higher rewritten in base 10.at n=24A121205
- Aliquot sequence starting at 3630.at n=2A143930
- a(n) = 6*(10^n-7).at n=2A177098
- Number of 0..1 arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo 2.at n=22A200661
- Number of 4-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=19A209345
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two, three or four distinct values for every i<=n and j<=n.at n=7A211479
- The values of k in A220141.at n=30A220142
- Numbers k that divide 2^k + 8.at n=18A245319