16487
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16488
- 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
- 16486
- Möbius Function
- -1
- Radical
- 16487
- 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
- 97
- 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
- 1911
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p from A031924 such that A052180(primepi(p)) = 11.at n=35A052232
- Series for 2nd perpendicular moment of square lattice bond percolation near a wall (eventually goes negative).at n=12A056601
- Numbers which are primes and which remain prime for three successive applications of incrementing each digit by 2 with carries ignored.at n=20A088787
- Smallest prime p > 3 such that p-1 has a prime factor > (p-1)^(n/(n+1)).at n=12A111671
- Number of permutations of length n which avoid the patterns 123, 2431, 4132.at n=14A116713
- Primes congruent to 4 mod 53.at n=37A142534
- Primes congruent to 26 mod 59.at n=28A142753
- Primes congruent to 17 mod 61.at n=30A142815
- Number of binary strings of length n with no substrings equal to 0001, 0100, or 1011.at n=25A164466
- Central term of nine successive primes whose average is a prime.at n=30A180457
- Numbers k such that 3^k + 10 is prime.at n=22A217137
- Primes p that become composite when any nonzero decimal digit is appended or deleted on the right or left of p.at n=33A226144
- Primes p such that p*2^(p-1)-1 is prime.at n=5A237251
- a(n) = number of unlabeled rooted trees on n nodes with an odd number of endpoints.at n=13A253014
- Expansion of x^6/((1 - x)^2*(1 - 2*x + x^3 - x^4)).at n=13A290986
- Number of nX4 0..1 arrays with every element equal to 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A300431
- a(n) = Sum_{k=1..n} k * tau(k)^2, where tau is A000005.at n=37A320896
- Primes p such that p^11 - 1 has 8 divisors.at n=9A342067
- a(n) is the least integer k such that k*prime(n) is in A346113, or 0 if no such k exists.at n=30A346177
- Prime numbersat n=1911