16700
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
- 18
- Divisor Sum
- 36456
- Proper Divisor Sum (Aliquot Sum)
- 19756
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6640
- Möbius Function
- 0
- Radical
- 1670
- Omega Function (Ω)
- 5
- 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
- 115
- 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
- First differences of the central trinomial coefficients A002426.at n=10A025178
- Numbers n such that n and the four successive integers produce primes if substituted for x in the polynomial 5x^2+5x+1. See A090562, A090563. Terms show that longer similar chains also exist.at n=12A090100
- Sum_{k=1..n-1} J(2*n,k)*k^2, where J(i,j) is the Jacobi symbol.at n=49A097543
- Sum_{k=1..2n-1} J(4*n,k)*k^2, where J(i,j) is the Jacobi symbol.at n=24A097544
- Number of segments needed to draw (on the infinite square grid) a diagram of regions and partitions of n.at n=31A211026
- Number of length n arrays x(i), i=1..n with x(i) in i..i+6 and no value appearing more than 3 times.at n=4A250359
- T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 3 times.at n=49A250361
- Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 3 times.at n=5A250363
- Triangle read by rows: T(n,k) = number of sets of linear n-ads in k variables.at n=31A260340
- Triangle read by rows: T(n,k) = number of sets of linear n-ads in k variables.at n=32A260340
- Numbers that are equal to the sum of the number of divisors of their first k arithmetic derivatives, for some k.at n=32A269459
- Numbers k such that Bernoulli number B_{k} has denominator 33330.at n=3A295589
- Number of nonequivalent n X n binary matrices with 3 ones in every row and column up to permutation of rows.at n=7A333899
- Number of nonequivalent n X n binary matrices with 4 ones in every row and column up to permutation of rows.at n=7A333900
- a(1) = 1; a(n) = 1 + a(n-1) + Sum_{k=2..n} a(floor(n/k)).at n=38A351621
- Sum of numbers in n-th upward diagonal of triangle the sum of {1; 2,3; 4,5,6; 7,8,9,10; ...} and {1; 2,3; 3,4,5; 4,5,6,7; ...}.at n=46A356288
- Number of permutations of {1..n} with all equal lengths of maximal runs (increasing by 1).at n=8A384892