10940
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23016
- Proper Divisor Sum (Aliquot Sum)
- 12076
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4368
- Möbius Function
- 0
- Radical
- 5470
- 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
- 161
- 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 that are the sum of 10 positive 7th powers.at n=45A003377
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=38A024467
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.at n=37A025087
- Values of A038007 not ending in 6 or 8.at n=17A038009
- Sequence arising in search for Legendre sequences.at n=15A039796
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=19A064976
- Even numbers n such that 37^2 (the square of the first irregular prime) divides the numerator of Bernoulli(n).at n=19A090789
- a[n] =a[n-1] + 2*n*Prime[n]-n^2.at n=17A093809
- Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=14A097647
- a(n) = number of primes p, p <= 2^n, where 2^n + p is composite.at n=17A175148
- Number of (2,0)-separable partitions of n; see Comments.at n=53A239482
- G.f. A(x) satisfies: A(x) = 1 + x*A(x^2)/(1 - x)^2.at n=35A307889
- Total area of all triangles such that p + q = 2*n, p < q (p, q prime), with base (q - p) and height q.at n=41A334119
- Number of distinct residues of x^n (mod n^5), x=0..n^5-1.at n=17A365102
- First differences of A112877 (zero terms in Cald's sequence A006509).at n=10A370951
- Positions of -4's in A346242.at n=47A372564