8775
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17360
- Proper Divisor Sum (Aliquot Sum)
- 8585
- 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
- 4320
- Möbius Function
- 0
- Radical
- 195
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 140
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=43A000338
- a(n) = 4*binomial(4*n+11, n)/(n+4).at n=4A006635
- a(n) = n*(n+1)*(n+2)/2.at n=25A027480
- a(n) = n*(2*n-1)*(2*n+1).at n=13A035328
- A convolution triangle of numbers obtained from A034171.at n=32A035529
- Distinct odd numbers in the triangle of denominators in Leibniz's Harmonic Triangle.at n=26A046201
- Odd numbers divisible by exactly 6 primes (counted with multiplicity).at n=25A046319
- Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).at n=17A049411
- Numbers k such that 2*3^k + 5 is prime.at n=25A057911
- Numbers k such that k divides Sum_{i=1..k} gcd(k,i) = A018804(k).at n=42A066862
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=32A072016
- Numbers k such that Sum_{i=1..k} gcd(k,i) divides Sum_{i=1..k} lcm(k,i).at n=9A072109
- Least n such that n consecutive values in A080378 equals 2; i.e., exactly n differences between consecutive primes give residues 2 when divided by 4.at n=12A080379
- Numbers k such that k^2 = x^3 + y^4 with positive integers x, y.at n=23A087209
- a(n) = n^3+n for odd n, (n^3+n)*3/2 for even n: Row sums of A093915.at n=17A093917
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^8-M)/7, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=17A096042
- a(n) = (10^k - n)(10^k + n), where k is the number of digits in n.at n=34A110397
- Denominator of sum of reciprocals of first n pentatope numbers A000332.at n=23A118412
- Number of permutations of n distinct letters (ABCD...) each of which appears 5 times and having n-2 fixed points.at n=26A123296
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=7A125016