10249
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10564
- Proper Divisor Sum (Aliquot Sum)
- 315
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9936
- Möbius Function
- 1
- Radical
- 10249
- 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
- 60
- 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
- Number of ordered triples of integers from [ 1..n ] with no global factor.at n=40A015631
- Pseudoprimes to base 60.at n=25A020188
- Strong pseudoprimes to base 60.at n=11A020286
- Numbers k such that the continued fraction for sqrt(k) has period 75.at n=5A020414
- a(n) = n*(15*n - 1)/2.at n=37A022272
- a(n) = Sum_{k=0..floor(n/2)} T(n,k), T given by A026769.at n=12A026777
- Numbers with exactly five distinct base-10 digits.at n=11A031987
- Numbers k such that 171*2^k-1 is prime.at n=29A050837
- Engel expansion of Sum_{k>=0} 1/(3 + k)^k.at n=13A063186
- Numbers k such that sopf(k)*nud(k) = pi(k), where sopf(k)=A008472, nud(k)=A034444 and pi(k)=A000720.at n=9A064015
- Number of permutations of length 2n satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..2n, with k=3, r=3, I={-2,0,1,2}. There is no one such permutation of length 2n+1.at n=16A079980
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-2,0,1,2}.at n=32A079981
- phi(n) plus the n-th prime gives a cube.at n=7A114085
- phi(n) plus the n-th prime gives a square.at n=31A116021
- E.g.f.: A(x) = exp( Sum_{n>=0} x^(3^n)/3^((3^n -1)/2) ).at n=9A118932
- A106486-encodings of combinatorial games equivalent to game {0|1}.at n=40A125997
- Sum of coefficients of polynomials defined in comments lines.at n=12A129891
- a(n) = (9*n^2 - 5*n + 2)/2.at n=48A140064
- Number of binary strings of length n with no substrings equal to 000 or 011.at n=28A164315
- a(n) = A168174(n)-10^12.at n=11A168248