10918
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16848
- Proper Divisor Sum (Aliquot Sum)
- 5930
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5304
- Möbius Function
- -1
- Radical
- 10918
- 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
- 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 that can be expressed as the product of two 3-digit numbers in at least one way.at n=28A033829
- a(n) = prime(n)*prime(n+1) - prime(n).at n=26A037166
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057040(n)=i(F(n)), where F(n) is the n-th Fibonacci number.at n=41A057040
- a(0) = 1; a(n) is obtained by incrementing each digit of a(n-1) by 9.at n=3A061749
- Number of paths of length n+2 originating at a corner of a 4 X 4 Boggle board.at n=6A063000
- a(n) is the least k such that k*Mrs(n)*Mrs(n+1)*Mrs(n+2) + 1 is prime, where Mrs(n) is the n-th Mersenne prime.at n=18A082747
- a(n) = (3*n+1)*(3*n+4).at n=34A085001
- Expansion of (1+2x)^2/((1-x^2)(1-2x)).at n=11A085278
- Number of non-Fibonacci parts in all partitions of n.at n=29A144116
- Number of n X n arrays of squares of integers, symmetric about main diagonal, with all rows summing to 49.at n=4A156510
- Number of (n+2) X (n+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=3A202454
- Number of (n+2) X 6 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=3A202457
- T(n,k)=Number of (n+2)X(k+2) binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=24A202461
- Number of nX1 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column or nw-to-se diagonal.at n=8A206727
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column or nw-to-se diagonal.at n=36A206734
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z-1 z-1 z in any row or column.at n=36A207201
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z-1 z-1 z in any row, column, nw-to-se diagonal or ne-to-sw antidiagonal.at n=36A207208
- T(n,k)=Number of nXk 0..2 arrays avoiding the pattern z+1 z+1 z horizontally and z-1 z-1 z vertically.at n=36A207358
- Rectangular array A read by upward antidiagonals in which the entry in row n and column k is defined by A(n,k) = (2^a(n)*(6*k - (3 - (-1)^a(n))*(1 - (-1)^n)/2) - 2^n + 4)/6, n,k >= 1, where {a(n)} is the Beatty sequence A117630 defined by a(n) = floor(n*log(3)/log(3/2)).at n=16A254312
- Expansion of Product_{k>=1} 1/(1-x^(4*k-3))^k.at n=52A263137