16547
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16548
- 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
- 16546
- Möbius Function
- -1
- Radical
- 16547
- 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
- no
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1915
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=38A050666
- Primes p from A031924 such that A052180(primepi(p)) = 13.at n=27A052233
- Prime number spiral (clockwise, East spoke).at n=22A054555
- a(n) is the coefficient of x^n in x/(1 + Sum_{k>=1} (1/2)*(prime(k+1) - 1)*x^k).at n=49A074142
- Sums of groups in A075635.at n=29A075636
- Number of positions that are exactly n moves from the starting position in the Diamond puzzle.at n=8A079743
- Duplicate of A079743.at n=8A079765
- a(n) = Sum_{k=1..n} floor(binomial(n,k)/k).at n=17A101687
- Prime septets of form k, k+2100, k+4200, k+6300, k+8400, k+10500, k+12600.at n=13A123107
- An example of a simple prime-generating algorithm similar to Rowland's (A106108) that is a particular instance of a more general algorithm (see comments).at n=41A141537
- Primes congruent to 11 mod 53.at n=36A142541
- Primes congruent to 27 mod 59.at n=33A142754
- Primes congruent to 16 mod 61.at n=29A142814
- Primes of the form 2^x+2*x+y+2^y, with x and y integers of any sign.at n=32A162575
- Number of strictly increasing arrangements of n nonzero numbers in -(n+4)..(n+4) with sum zero.at n=7A188119
- Number of strictly increasing arrangements of 8 nonzero numbers in -(n+6)..(n+6) with sum zero.at n=5A188127
- Primes p with property that there exists a number d>0 such that numbers p-k*d, k=1...7, are seven primes.at n=19A216590
- Prime sums of five Mersenne primes.at n=39A269666
- n such that A275391(n) = n-2.at n=52A275800
- Number of squares after the n-th generation in a symmetric (with 45-degree angles) non-overlapping Pythagoras tree.at n=18A276647