11777
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11778
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11776
- Möbius Function
- -1
- Radical
- 11777
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 81
- 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
- 1410
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest number containing n syllables in UK English.at n=14A002810
- Primes that contain digits 1 and 7 only.at n=13A020455
- Primes that remain prime through 3 iterations of function f(x) = 10x + 3.at n=33A023300
- Primes that remain prime through 4 iterations of function f(x) = 10x + 3.at n=2A023328
- Primes of the form k^2 + k + 5.at n=30A027755
- Primes in which each digit occurs in runs of at least 2.at n=2A034873
- Smallest positive integer requiring n syllables to pronounce in American English.at n=13A045736
- Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=9A051900
- Primes at which the difference pattern X24Y (X and Y >= 6) occurs in A001223.at n=26A052163
- First term of weak prime quintets: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=25A054823
- Lesser of irregular twin primes.at n=36A060012
- Prime numbers with odd digits in ascending order.at n=41A061244
- Numbers k such that sigma(k+2) - sigma(k) = prime(k+1) - prime(k).at n=32A067062
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3.at n=16A074709
- Base 4 expansion of 1/n has equal percentage of each digit 0,1,2,3 (primitive values of n only).at n=14A074900
- a(n) = 512*n + 1.at n=23A076338
- Primes of the form 512*k+1.at n=2A076339
- Least prime of the form n*2^m+1 for m>0, or 0 if there is no such prime.at n=45A078683
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <= 6 (i.e., when d = 2, 4 or 6) and forming pattern = [2, 4, 6]; short notation = [246] d-pattern.at n=21A078847
- First prime after phi(prime(n)^2).at n=28A079477