10930
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19692
- Proper Divisor Sum (Aliquot Sum)
- 8762
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4368
- Möbius Function
- -1
- Radical
- 10930
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- 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 27.at n=41A020366
- a(n) = Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026692.at n=5A026994
- Numbers k such that 2^k mod k = 2^k mod k^2.at n=29A068535
- Rounded value of n*L_n(-1) where L is the Laguerre polynomial.at n=19A070070
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=11A073476
- Sequence A075166 interpreted as binary numbers and converted to decimal.at n=38A075165
- Partial sums of A005578.at n=14A086445
- Values of r such that N(r)/r^2 > Pi, where N(r) is the number of integer lattice points (x,y) inside or on a circle of radius r.at n=47A093832
- Least even pseudoprime > p to base p, where p = prime(n).at n=35A108162
- Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=15A125773
- Triangle T(n,k) read by rows: T(n, k) = (4*n-4*k+1)*T(n-1, k-1) + (4*k-3)*T(n-1, k) + 4*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.at n=22A144441
- Triangle T(n,k) read by rows: T(n, k) = (4*n-4*k+1)*T(n-1, k-1) + (4*k-3)*T(n-1, k) + 4*T(n-2, k-1) with T(n, 1) = T(n, n) = 1.at n=26A144441
- Number of cubic equations ax^3 + bx^2 + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal.at n=37A155192
- Partial sums of Pillai primes (A063980).at n=39A172034
- Number of nonempty subsets of {1, 2, ..., n} with <=6 pairwise coprime elements.at n=26A187267
- Coefficient of x in the reduction of the n-th Fibonacci polynomial by x^3->x^2+1.at n=17A192781
- Catalan Unranking function U(size,rank) for totally balanced binary strings (converted to decimal). Each row 'size' of an array lists all A000108(size) such items in standard lexicographic order, followed by an infinite number of zeros.at n=52A213704
- Expansion of (1-x)*(1-2x)*(1-3x)/((1-5x+5*x^2)*(1-3x+x^2)).at n=8A217782
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 7.at n=44A240016
- Numbers n such that phi(n) = phi(n+10), with Euler's totient function phi = A000010.at n=40A276503