16696
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 31320
- Proper Divisor Sum (Aliquot Sum)
- 14624
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8344
- Möbius Function
- 0
- Radical
- 4174
- Omega Function (Ω)
- 4
- 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
- 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
- Numbers k such that 7*2^k+1 is prime.at n=24A032353
- Numbers k such that 265*2^k + 1 is prime.at n=21A053349
- a(0)=0; for n>0, a(n) = Sum_{d|n} d*2^(n/d).at n=14A054598
- Interprimes which are of the form s*prime, s=8.at n=26A075283
- a(n) = (27*n^2 + 9*n + 2)/2.at n=35A093485
- a(n) is the number of integers x that can be written x = (2^c(1) - 2^c(2) - 3*2^c(3) - 3^2*2^c(4) - ... - 3^(m-2)*2^c(m) - 3^(m-1)) / 3^m for integers c(1), c(2), ..., c(m) such that n = c(1) > c(2) > ... > c(m) > 0 and c(1) - c(2) != 2 if m >= 2.at n=39A131450
- Records in A139251.at n=46A152768
- a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1.at n=38A173980
- Numbers n such that gcd(n, phi(n)) = gcd(phi(n), sigma(n)) = gcd(sigma(n), n) = tau(n).at n=31A217301
- Number of (n+5)X6 0..1 matrices with each 6X6 subblock idempotent.at n=2A224570
- Number of (n+5) X 8 0..1 matrices with each 6 X 6 subblock idempotent.at n=0A224572
- T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent.at n=3A224577
- T(n,k)=Number of (n+5)X(k+5) 0..1 matrices with each 6X6 subblock idempotent.at n=5A224577
- Triangle read by rows: numerators of coefficients of the Hirzebruch L-polynomials L_n expressing the signature of a 4n-dimensional manifold in terms of its Pontrjagin numbers (as in Hirzebruch Signature Theorem).at n=37A237111
- Numbers n such that the sum of the distinct prime factors of prime(n)-1 and prime(n+1)-1 are the same.at n=12A259562
- Expansion of Product_{k>=1} 1 / ((1-x^(3*k-1))^(3*k-1) * (1-x^(3*k-2))^(3*k-2)).at n=20A262923
- Number of nX4 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A317867
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=69A317871
- Triangle read by rows: T(m,n) (m >= n >= 1) = number of edges formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid.at n=23A333283
- Expansion of Product_{k>=1} 1 / (1 - x^(3*k-1))^2.at n=55A374018