6875
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 9372
- Proper Divisor Sum (Aliquot Sum)
- 2497
- 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
- 5000
- Möbius Function
- 0
- Radical
- 55
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 88
- 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
- Numbers of the form 5^i * 11^j.at n=15A003598
- a(n) = n OR n^3 (applied to binary expansions).at n=18A008468
- Coordination sequence for Ni2In, Position Ni1 and In.at n=25A009941
- a(n) = Sum_{k=1..n} ceiling(k^4/n).at n=12A014816
- Numbers k that divide s(k), where s(1)=1, s(j)=11*s(j-1)+j.at n=10A014858
- Odd numbers k that divide phi(k)*sigma(k).at n=13A015706
- Fibonacci sequence beginning 2, 17.at n=14A022118
- Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(5).at n=31A022770
- a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=31A025003
- a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026374.at n=9A026950
- a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026386.at n=9A026955
- 3-automorphic numbers ending in 5: final digits of 3*n^2 agree with n.at n=3A030986
- Numbers k such that 99*2^k+1 is prime.at n=36A032399
- a(n) = 11*n^2.at n=25A033584
- Composite numbers whose prime factors contain no digits other than 1 and 5.at n=16A036305
- Numbers whose prime factors are in {5, 7, 11}.at n=35A036490
- Transformation of A036490: 5^a*7^b*11^c -> 5^a*7^floor((b+2)/2)*11^c.at n=35A036491
- Numbers k that divide 3^k + 2^k.at n=12A045576
- Numbers k that divide 7^k + 3^k.at n=22A045586
- Numbers k that divide 6^k + 4^k.at n=31A045591