10893
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14528
- Proper Divisor Sum (Aliquot Sum)
- 3635
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7260
- Möbius Function
- 1
- Radical
- 10893
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of e.g.f. cosh(log(1+x))*cos(x).at n=8A009128
- Convolution of natural numbers n >= 1 with Fibonacci numbers F(k), k >= 3.at n=14A033937
- n*nextprime((n-1)!)-nextprime(n!).at n=45A089014
- Numbers k such that k^2+4, k^2+8, and k^2+10 are prime.at n=12A157929
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=38A186754
- a(0)=1, a(n) = a(n-1) + a(2*n AND n), where AND is the bitwise AND operator.at n=34A215488
- Numbers k such that 7*R_k + 10 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A256906
- Number of nX6 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=1A280671
- T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=22A280673
- Number of 2 X n 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=5A280674
- Numbers k such that (49*10^k - 67)/9 is prime.at n=18A291609
- Numbers k such that (47*10^k - 119)/9 is prime.at n=17A291868
- Number of nX2 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=9A303721
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=56A303727
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 7 king-move adjacent elements, with upper left element zero.at n=56A304775
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3 or 8 king-move adjacent elements, with upper left element zero.at n=56A305230
- a(n) = sum of the first n primes whose distance to next prime is 4.at n=32A360226
- Compositions (ordered partitions) of n into odd parts where the first part must be a maximal part.at n=25A368746
- Expansion of e.g.f. exp(x * cos(2*x)).at n=7A381275