10298
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16320
- Proper Divisor Sum (Aliquot Sum)
- 6022
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4860
- Möbius Function
- -1
- Radical
- 10298
- Omega Function (Ω)
- 3
- 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
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- (s(n)+s(n+1))/18, where s()=A006521.at n=21A016060
- Least k>1 such that reverse complement of first n terms of Kolakoski sequence (A000002) repeats beginning at k-th term.at n=50A025504
- Denominators of continued fraction convergents to sqrt(310).at n=12A041585
- After the first two terms, each subsequent term is the smallest integer that is an outlier of the previous dataset, based on the criterion of 3 sample standard deviations above the mean.at n=41A103231
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=32A127485
- Inverse permutation to A253561: a(n) = A252752(A122111(n)).at n=50A253562
- Triangle read by rows, T(n,k) = Sum_{j=0..n-k+1} P(n,j)*T(n-j,k-1) if k>0 else 0^n where P(n,j) is the number of j-partitions of n; for n>=0 and 0<=k<=n.at n=61A257566
- Number of set partitions C_t(n) of {1,2,...,t} into at most n parts, with an even number of elements in each part distinguished by marks; triangle C_t(n), t>=0, 0<=n<=t, read by rows.at n=34A261275
- Expansion of 1/(1 - Sum_{k = i^j, i>=1, j>=2} x^k).at n=27A282500
- a(n) is the smallest number that belongs simultaneously to the two arithmetic progressions prime(n) + m*prime(n+1) and prime(n+1) + m*prime(n+2), m >= 1, n >= 1.at n=24A319524
- a(n) = Sum_{k=1..n} k^3 * tau(k), where tau is A000005.at n=9A320895
- Numbers which are the sum of a prime and the square of the next prime.at n=24A349660
- Maximal coefficient of (1 + x) * (1 + x^16) * (1 + x^81) * ... * (1 + x^(n^4)).at n=33A359320
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-2*k,floor(k/3)).at n=41A376695
- Positions of proper prime powers (A246547) in EKG-sequence.at n=52A383295
- Numbers that can be written in exactly two different ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t} for some t > 0.at n=21A386966