16703
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 16704
- 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
- 16702
- Möbius Function
- -1
- Radical
- 16703
- 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
- 234
- 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
- 1933
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Apply partial sum operator 4 times to Fibonacci numbers.at n=14A014166
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=37A023296
- Primes that remain prime through 4 iterations of function f(x) = 9x + 2.at n=14A023324
- a(n) = T(2n+1, n+2), T given by A027948.at n=7A027954
- Euler transform of Thue-Morse sequence A001285.at n=24A029877
- Positions of non-crossing fixed-point-free involutions encoded by A014486 in A055089. Permutation of A064640.at n=15A064638
- Positions of non-crossing fixed-point-free involutions encoded by A014486 (after reflection) in A055089. Permutation of A064640.at n=15A064639
- Positions of non-crossing fixed-point-free involutions (encoded by A014486) in A055089, sorted to ascending order.at n=15A064640
- Append more digits to the n-th prime (leading zeros are permitted) until another prime is reached.at n=38A064792
- Numbers k such that phi(k) + phi(k+1) divides sigma(k) + sigma(k+1).at n=21A067282
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=42A097240
- Primes of the form (k+1)*prime(k) + k*prime(k+1).at n=18A097241
- 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=37A109561
- Primes p such that q-p = 26, where q is the next prime after p.at n=9A124594
- Primes in A126554.at n=6A126555
- a(n) is the least prime for which the n-th term of the sequence S(a(n)) belongs to A007500, where each term of S(p) is the least prime >= the reversal of the previous term.at n=18A135436
- Primes congruent to 8 mod 53.at n=39A142538
- Primes congruent to 6 mod 59.at n=34A142733
- Primes congruent to 50 mod 61.at n=31A142848
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, -1, 1), (0, 1, -1), (0, 1, 1), (1, 1, 1)}.at n=7A150991