10284
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24024
- Proper Divisor Sum (Aliquot Sum)
- 13740
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3424
- Möbius Function
- 0
- Radical
- 5142
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k where |cos(k)| (or |cosec(k)| or |cot(k)|) decreases monotonically to 0; also numbers k where |tan(k)| (or |sec(k)|, or |sin(k)|) increases.at n=34A004112
- Number of point labeled reduced 5-free two-graphs with n nodes.at n=7A007834
- Molien series of 4-dimensional representation of u.g.g.r. #9.at n=14A013977
- Molien series of 4-dimensional representation of u.g.g.r. #8.at n=28A013978
- Least k such that tan(k) > tan(a(n-1)), for n >= 1, where a(0) = 0.at n=45A024814
- Sin(n) decreases monotonically to -1.at n=19A046964
- McKay-Thompson series of class 8C for Monster.at n=7A052241
- Numbers k such that floor(tan(k)) > floor(tan(m)) for all m < k.at n=42A063537
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=18A079037
- Number of partitions of n into parts but with two kinds of parts of sizes 1,2,3,4,5 and 6.at n=18A103925
- Numbers k such that A109631(k) + A109631(k+1) = A109631(k+2).at n=10A109651
- Expansion of (chi(q)^5 * chi(-q))^2 in powers of q where chi() is a Ramanujan theta function.at n=14A143894
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=16A153747
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=29A172446
- a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=18A172448
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=16A192952
- Number of partitions of n for which (number of occurrences of the least part) < (number of occurrences of greatest part).at n=52A236545
- Number of n-length words w over a 5-ary alphabet such that w is empty or a prefix z concatenated with letter a_i and i=1 or 0 < #(z,a_{i-1}) >= #(z,a_i), where #(z,a_i) counts the occurrences of the i-th letter in z.at n=9A240611
- Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 6).at n=13A250262
- Number of permutations p of [n] such that p(i) > p(i+1) iff i == 0 (mod 6).at n=13A250283