10265
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12324
- Proper Divisor Sum (Aliquot Sum)
- 2059
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8208
- Möbius Function
- 1
- Radical
- 10265
- 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
- 135
- 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
- 1 + Sum_{n>=1} a_n x^n = Product_{n>=1} (1-x^n)^prime(n).at n=32A007441
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=67A011910
- Pisot sequence T(3,7), a(n) = floor(a(n-1)^2/a(n-2)).at n=10A020746
- Numbers with exactly five distinct base-10 digits.at n=20A031987
- Numbers n such that 147*2^n-1 is prime.at n=28A050599
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 17.at n=10A051982
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=43A061191
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = 8*k^2 + 4*k + 1.at n=36A103777
- A106486-encodings of combinatorial games equivalent to game {0|1}.at n=41A125997
- Numbers k such that continued fraction of (1 + sqrt(k))/2 has period 17.at n=30A146340
- n-th prime*8-7 is the square of a prime.at n=39A169583
- Half the number of nXnXn triangular binary arrays with each element having no more than two neighbors equal to itself.at n=7A183275
- Least number having exactly two odd prime factors that differ by 2*n^2.at n=31A190052
- Least number having exactly two odd prime factors that differ by 2^n.at n=10A190358
- Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(n + 1)(n + 2)/6.at n=38A227016
- Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=6A232849
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=21A232852
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=27A232852
- Semiprimes which have one or more occurrences of exactly five different digits.at n=4A235693
- Five-digit odd semiprimes with all digits distinct.at n=3A247948