16087
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16088
- 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
- 16086
- Möbius Function
- -1
- Radical
- 16087
- 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
- 53
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1872
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of forests with n nodes and height at most 4.at n=5A000951
- 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 d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=23A078852
- Triangle read by rows: T(n,k) = numerator of P(n, k) = 1 - n!/(n^k*(n-k)!).at n=19A089204
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=30A094933
- Prime(144*n).at n=12A102350
- Primes p such that p+1, p+2 and p+3 have equal number of divisors.at n=20A119711
- a(1) = 1, a(n) = the smallest prime divisor of A138793(n).at n=12A138962
- Primes congruent to 13 mod 47.at n=39A142364
- Primes congruent to 28 mod 53.at n=31A142558
- Primes congruent to 39 mod 59.at n=32A142766
- Primes congruent to 44 mod 61.at n=29A142842
- Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1001-1111-1000 pattern in any orientation.at n=11A146842
- Augmentation of the triangle A193605. See Comments.at n=39A193606
- Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1).at n=19A210725
- a(n) = 9*n^2 - 13*n + 5.at n=42A214675
- Greatest number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=11A217114
- Primes p such that f(f(p)) is prime, where f(x) = x^4-x^3-x^2-x-1.at n=32A230029
- Fourth prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=22A238676
- Primes p such that 2*p + 1 is abundant.at n=19A267476
- Prime numbers p such that the set of composite numbers in the range [p+1, nextprime(p)-1] has more than one element and all the elements have the same number of divisors.at n=4A332740