16763
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16764
- 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
- 16762
- Möbius Function
- -1
- Radical
- 16763
- 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
- 115
- 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
- 1938
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Iccanobif numbers: add a(n-1) to reversal of a(n-2).at n=19A014260
- The $620 prime list.at n=7A018188
- Number of partitions of n into 10 unordered relatively prime parts.at n=40A023030
- Primes that remain prime through 3 iterations of function f(x) = 2x + 7.at n=16A023275
- Smallest prime with "n^2" as central digit(s).at n=26A038370
- a(n) is the smallest prime p such that p, p+d, and p+2d are consecutive primes where d = 2 for n = 1 and d = 6*(n-1) for n > 1.at n=4A052187
- Primes p such that p, p+24, p+48 are consecutive primes.at n=0A052190
- The smallest initial prime of 2 non-overlapping d-twin primes if the distance between pairs (D) is minimal (see A052380).at n=11A052381
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) is a multiple of 2n.at n=11A054682
- a(n) is the smallest prime p such that p and the next n-1 primes are all == 11 (mod 12).at n=3A068235
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.at n=11A070018
- Smallest prime equal to the sum of 2n+1 consecutive primes.at n=38A070934
- Smallest odd prime that is the sum of 2n+1 consecutive primes.at n=38A082244
- Starting positions of strings of three 8's in the decimal expansion of Pi.at n=10A083637
- Primes whose successive differences are increasing squares.at n=9A088173
- Primes p such that q-p = 24, where q is the next prime after p.at n=25A098974
- a(n) = (1/6)*(n^3 + 21*n^2 + 74*n + 18).at n=40A103145
- Primes in A103372.at n=13A103382
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 7.at n=38A109561
- Sum of primes between n and n^2.at n=20A109818