16759
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16760
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16758
- Möbius Function
- -1
- Radical
- 16759
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 159
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1937
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=30A031838
- Prime number spiral (clockwise, Southeast spoke).at n=22A054564
- Primes p such that p-1 divides 2^p-2.at n=18A069051
- a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=10, a(2)=30.at n=28A104863
- Primes that do not divide any term of the Lucas 4-step sequence A073817.at n=17A106300
- Prime Friedman numbers.at n=13A112419
- Prime numbers n such that n^2 +- (n-1) are primes.at n=39A137459
- Primes congruent to 11 mod 53.at n=37A142541
- Primes congruent to 3 mod 59.at n=32A142730
- Primes congruent to 45 mod 61.at n=32A142843
- a(n) = 441*n + 1.at n=37A158322
- a(n) = 38*n^2 + 1.at n=21A158593
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2 at level 0. The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=49A182891
- Number of weighted lattice paths in L_n having no (1,0)-steps of weight 2 at level 0.at n=13A182892
- Primes p such that p^2 divides 2^(2^(p-1)-1) - 1.at n=21A188465
- Minimal order of degree-n irreducible polynomials over GF(29).at n=37A218364
- Primes p such that b=2*p+1 is semiprime, c=2*b+1 is 3-almost prime and d=2*c+1 is 4-almost prime.at n=14A235646
- Lesser of consecutive primes whose average is a palindromic number.at n=32A242387
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 473", based on the 5-celled von Neumann neighborhood.at n=28A272425
- Sum of cubes of proper divisors of n.at n=49A276634