10261
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10624
- Proper Divisor Sum (Aliquot Sum)
- 363
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9900
- Möbius Function
- 1
- Radical
- 10261
- Omega Function (Ω)
- 2
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.at n=22A001567
- Divisors of 2^30 - 1.at n=38A003538
- Truncated square numbers: 7*n^2 + 4*n + 1.at n=38A005892
- a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=27A006004
- Euler pseudoprimes: composite numbers n such that 2^((n-1)/2) == +-1 (mod n).at n=14A006970
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=38A014112
- Strong pseudoprimes to base 4.at n=10A020230
- Strong pseudoprimes to base 16.at n=37A020242
- Strong pseudoprimes to base 64.at n=32A020290
- Strong pseudoprimes to base 75.at n=21A020301
- Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.at n=11A050217
- 24-gonal numbers: a(n) = n*(11*n-10).at n=31A051876
- Composite numbers k which divide A001045(k-1).at n=17A066488
- a(n) is the smallest n-digit pseudoprime (to base 2).at n=2A068216
- Numbers which are sums of two and also sums of three positive cubes.at n=19A085336
- Numbers which are sums of two, three and four cubes.at n=9A085337
- Numbers which are sums of two, three, four and also sums of five cubes.at n=8A085338
- Semiprimes that are the sum of two positive cubes. Common terms of A003325 and A046315.at n=36A085366
- Smallest base-2 Fermat pseudoprime x that has ord(2,x) = n, or 0 if one does not exist.at n=29A086250
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.at n=27A089042