15767
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 15768
- 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
- 15766
- Möbius Function
- -1
- Radical
- 15767
- 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
- 84
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1839
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of permutations in S_n with longest increasing subsequence of length <= 3 (i.e., 1234-avoiding permutations); vexillary permutations (i.e., 2143-avoiding).at n=8A005802
- Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).at n=30A047887
- Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.at n=47A047888
- Primes p from A031924 such that A052180(primepi(p)) = 13.at n=23A052233
- Indices of primes in sequence defined by A(0) = 33, A(n) = 10*A(n-1) + 43 for n > 0.at n=12A056255
- Self-convolution forms A093638.at n=8A093639
- Balanced primes of order five.at n=33A096697
- Primes of the form 210k + 17.at n=36A140842
- Primes p such that p - 6^2, p - 6, p + 6 and p + 6^2 are also primes.at n=34A141279
- Primes congruent to 26 mod 53.at n=34A142556
- Primes congruent to 14 mod 59.at n=33A142741
- Primes congruent to 29 mod 61.at n=36A142827
- Primes which are anagrams of cubes.at n=30A161854
- Primes of the form 3*k^2 + 9*k + 5.at n=27A171838
- Numbers m such that m, m-1, m-2 and m-3 are 1,2,3,4-almost primes respectively.at n=28A201220
- Number of permutations A(n,k) in S_n with longest increasing subsequence of length <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=74A214015
- Partial sums of A253086.at n=53A255150
- Primes p for which the greatest common divisor of 2^p+1 and 3^p+1 is greater than 1.at n=38A260674
- Number of permutations of [2n] avoiding the pattern 12...n.at n=4A269042
- Balanced primes of order one ending in 7.at n=37A303094