16927
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16928
- 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
- 16926
- Möbius Function
- -1
- Radical
- 16927
- 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
- 110
- 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
- 1952
- 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=31A031838
- Numbers whose base-5 representation contains exactly three 0's and three 2's.at n=15A045187
- Numbers p from A001125 such that 2*p-3 is prime.at n=22A063939
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=26A078852
- Primes p such that A001414(p-1) = A001414(p+1), where A001414 = sum of primes dividing n (with repetition).at n=7A086711
- Primes of the form 8*k^2 - 1.at n=21A090684
- Primes p such that the sum of the digits of p is not prime, but the sum of the cubes of the digits of p is prime.at n=24A091365
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.at n=27A092475
- Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=5A096554
- Primes p equal to the sum of two successive sexy primes - 1 such that p - 6 is also prime.at n=27A104047
- a(n) = 3^(n-1) - ceiling(n^n/n!).at n=9A127634
- Primes of the form 88x^2+32xy+127y^2.at n=28A140630
- Primes congruent to 7 mod 47.at n=40A142358
- Primes congruent to 20 mod 53.at n=33A142550
- Primes congruent to 53 mod 59.at n=33A142780
- Primes congruent to 30 mod 61.at n=30A142828
- a(n) = 529*n - 1.at n=31A158365
- a(n) = 32*n^2 - 1.at n=22A158563
- a(n) = n^3 - 4*n^2 + 6*n - 2.at n=24A188377
- Primes of the form n^2+number of divisors of n^2.at n=20A188665