8995
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12384
- Proper Divisor Sum (Aliquot Sum)
- 3389
- 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
- 6144
- Möbius Function
- -1
- Radical
- 8995
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=23A010007
- Numbers n such that phi(n + 1) | sigma(n) for n congruent to 1 (mod 3).at n=27A015817
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 11 ones.at n=21A031779
- Lucky numbers that are decimal concatenations of n with n + 6.at n=11A032656
- Numbers whose set of base-16 digits is {2,3}.at n=19A032816
- Numbers n > 13 such that x^n + x^13 + x^12 + x^11 + x^10 + x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=34A057489
- a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).at n=23A062020
- Smallest multiple of 5 with digit sum n.at n=30A069534
- Floor of ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.at n=13A072168
- Sum of odd-indexed primes.at n=43A077131
- A triangular array related to A077028 and distributing the values of A007582.at n=40A110552
- The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=40A112358
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 4 ones in any 5 X 5 X 5 subtriangle.at n=15A153937
- (n^3 - n + 15)/3.at n=29A155757
- a(n) = n*(15*n-11)/2.at n=35A226489
- Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 9.at n=47A244463
- Numbers k such that 7*10^k - 23 is prime.at n=23A272271
- Sum of the squarefree parts of the partitions of n into 6 parts.at n=29A309481
- Numerator of the average distance among first n primes.at n=22A332094
- Odd composite numbers k such that A053575(k) [the odd part of phi] divides k-1.at n=33A339880