10498
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16380
- Proper Divisor Sum (Aliquot Sum)
- 5882
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- -1
- Radical
- 10498
- 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
- 130
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 25.at n=33A020364
- a(n) = n*(25*n - 1)/2.at n=29A022282
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=34A031419
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 5).at n=43A035553
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is an acute scalene integer triangle with prime side lengths.at n=30A070123
- Numbers n such that A065863(n) = 1, i.e., prime(n) mod (n - Pi(n)) = 1.at n=21A072623
- Indices of primes in sequence defined by A(0) = 31, A(n) = 10*A(n-1) + 61 for n > 0.at n=9A101841
- Numbers n such that A064168(n) is prime.at n=66A123538
- Lesser of twin simili-primes of order 2.at n=36A126699
- a(n) = n-th prime * n-th nonprime.at n=41A127118
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, -1)}.at n=11A148025
- a(n) = p(n)*p(n+2) - 3*p(n+1), where p(n) is the n-th prime.at n=25A152528
- Triangle of coefficients from a polynomial recursion with row sum near =2*5^n: p(x,n)=(x + 1)*(p(x, n - 1) + 2*5^(n - 2)*(x + 5*x^Floor[n/2] + x^(n - 2))).at n=25A153354
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,4,1,2 for x=0,1,2,3,4.at n=12A196141
- a(0) = 1; for n > 0, a(n) = 41*n^2 + 2.at n=16A206399
- Number of partitions p of n such that (number of numbers of the form 5k + 4 in p) is a part of p.at n=37A241553
- Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x-k)^k for 0 <= k <= n.at n=38A242598
- Numbers n such that phi(n) = phi(n+10), with Euler's totient function phi = A000010.at n=38A276503
- Numbers whose multiset multisystem (A302242) is crossing.at n=21A324170
- Let P1, P2, P3, P4 be consecutive primes, with P2 - P1 = P4 - P3 = 2. a(n) = (P1 + P2)/12 for the first occurrence of (P3 - P1)/6 = n.at n=6A329250