16174
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 24264
- Proper Divisor Sum (Aliquot Sum)
- 8090
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8086
- Möbius Function
- 1
- Radical
- 16174
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 27
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that sigma(k+1)+sigma(k) = sigma(2k+1).at n=4A067171
- Numbers k such that (sigma(k)+sigma(k+1))/sigma(2*k+1) is an integer, where sigma = A000203.at n=10A091287
- Duplicate of A067171.at n=4A091288
- a(n) is the least k such that (k*prime(n)#)^2 + 1, ((k+1)*prime(n)#)^2 + 1 and ((k+2)*prime(n)#)^2 + 1 are 3 primes, where prime(n)# is the n-th primorial.at n=40A098765
- Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off every 5th term. Repeat, always crossing off every 5th term of those that remain. The numbers that are left form the sequence.at n=39A100586
- Numbers n such that 8*10^n + R_n + 8 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A103073
- Record indices of the ratio A002375(n) / n (Goldbach conjecture related).at n=46A137820
- Sequence A154693 adjusted to leading one:t(n,m)=A154693(n,m)-A154693(n,0)+1.at n=29A174672
- Sequence A154693 adjusted to leading one:t(n,m)=A154693(n,m)-A154693(n,0)+1.at n=34A174672
- Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=43A184063
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}.at n=39A209993
- Number of (w,x,y,z) with all terms in {1,...,n} and w >= (geometric mean of x,y,z).at n=13A212142
- a(n) = 2^n - n^2 - n.at n=14A220588
- Number of (6+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically.at n=11A253703
- Number of n X 3 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=10A280064
- Numbers k such that (22*10^k - 37)/3 is prime.at n=20A285785
- Number of n X 2 0..1 arrays with each 1 adjacent to 0, 2 or 3 king-move neighboring 1s.at n=8A296668
- T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 2 or 3 king-move neighboring 1s.at n=46A296674
- a(n) is the number of configurations of n indistinguishable pairs placed on the vertices of the ladder graph P_2 X P_n such that all but 3 such pairs are joined by an edge.at n=8A318268
- Difference between 4^n and the product of primes less than or equal to n.at n=7A319857