1151
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1152
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1150
- Möbius Function
- -1
- Radical
- 1151
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 57
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 190
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).at n=8A000101
- Lesser of twin primes.at n=40A001359
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=9A001583
- Smallest prime p such that there is a gap of 2n between p and previous prime.at n=10A001632
- a(n+6) = -a(n+5) + a(n+4) + 3a(n+3) + a(n+2) - a(n+1) - a(n). a(n) = sign(n) if abs(n)<=3.at n=25A001945
- Smallest prime == 7 (mod 8) where Q(sqrt(-p)) has class number 2n+1.at n=20A002146
- Sum of digits of n-th term in Look and Say sequence A005150.at n=22A004977
- Class 1+ primes: primes of the form 2^i*3^j - 1 with i, j >= 0.at n=19A005105
- Class 4- primes (for definition see A005109).at n=27A005112
- Related to series-parallel networks.at n=6A006350
- Number of partitions of n with at least 1 odd and 1 even part.at n=23A006477
- Emirps (primes whose reversal is a different prime).at n=46A006567
- Primes of the form 8n+7, that is, primes congruent to -1 mod 8.at n=48A007522
- Coordination sequence T1 for Zeolite Code AFY.at n=28A008029
- Coordination sequence T1 for Zeolite Code EUO.at n=21A008095
- Coordination sequence T5 for Zeolite Code CON.at n=24A009872
- a(n) = prime(n*(n+1)/2).at n=18A011756
- Numbers k such that phi(k + 13) | sigma(k).at n=37A015833
- Coordination sequence T1 for Zeolite Code TER.at n=23A016433
- Coordination sequence T1 for Zeolite Code CZP.at n=22A019456