1141
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1312
- Proper Divisor Sum (Aliquot Sum)
- 171
- 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
- 972
- Möbius Function
- 1
- Radical
- 1141
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 106
- 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
- From the expansion of sinh(x) / cos(x): a(n) = odd part of A002084(n).at n=4A002085
- Hex (or centered hexagonal) numbers: 3*n*(n+1)+1 (crystal ball sequence for hexagonal lattice).at n=19A003215
- a(n) = ceiling(n*phi^9), where phi is the golden ratio, A001622.at n=15A004964
- Number of unlabeled connected identity interval graphs with n nodes.at n=8A005974
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=23A007077
- Springer numbers associated with symplectic group.at n=6A007836
- Coordination sequence T1 for Zeolite Code LEV.at n=25A008127
- "Pascal sweep" for k=6: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=55A009475
- Coordination sequence T3 for Zeolite Code -PAR.at n=24A009857
- Coordination sequence T4 for Zeolite Code DFO.at n=26A009878
- Coordination sequence T4 for Zeolite Code VNI.at n=21A009910
- Positive integers n such that 2^n == 2^7 (mod n).at n=38A015927
- Pseudoprimes to base 58.at n=11A020186
- Pseudoprimes to base 59.at n=11A020187
- Strong pseudoprimes to base 58.at n=3A020284
- Strong pseudoprimes to base 59.at n=2A020285
- Numbers k such that the continued fraction for sqrt(k) has period 58.at n=0A020397
- Describe previous term from the right (method B - initial term is 4).at n=2A022515
- a(n) = a(n-1) + c(n-1) for n >= 2, a( ) increasing, given a(1)=5; where c( ) is complement of a( ).at n=42A022937
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (primes).at n=12A024597