16910
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 15490
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- 1
- Radical
- 16910
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 203
- 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 least term in the periodic part of the continued fraction for sqrt(k) is 26.at n=9A031704
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n} k^2.at n=19A050409
- Numbers m such that pi(m^2) is a square.at n=9A064523
- Starting positions of strings of three 8's in the decimal expansion of Pi.at n=11A083637
- Number of permutations of length n which avoid the patterns 321, 2143, 3124; or avoid the patterns 132, 2314, 4312, etc.at n=37A116731
- a(n) = Sum_{k=0..floor(n/2)} (n-k)^2.at n=38A129371
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=19A134263
- Padovan-like sequence; a(0)=2, a(1)=1, a(2)=1, a(n) = a(n-2) + a(n-3).at n=35A141038
- a(n) = 676*n^2 + 2*n.at n=4A158385
- a(n) = 100*n^2 + 10.at n=13A158492
- a(n) = 169*n^2 + n.at n=9A173275
- G.f. satisfies: A(x) = 1 + x*A(x)^2*A(-x)^2 + x^2*(A(x)^2 + A(-x)^2).at n=11A233896
- Number of length n+3 0..5 arrays with no four elements in a row with pattern abba (with a!=b) and new values 0..5 introduced in 0..5 order.at n=5A243386
- T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern abba (with a!=b) and new values 0..k introduced in 0..k order.at n=50A243389
- 26-gonal numbers: a(n) = n*(12*n-11).at n=38A255185
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 241", based on the 5-celled von Neumann neighborhood.at n=27A270990
- Number of nXn 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A317066
- Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A317068
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=24A317072
- Number of compositions of n with all adjacent parts (x, y) satisfying x > 2y or y = 2x.at n=60A342336