17183
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 17184
- 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
- 17182
- Möbius Function
- -1
- Radical
- 17183
- 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
- 141
- 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
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1978
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of binary rooted trees with n nodes and height at most 6.at n=22A036589
- Numbers whose base-7 representation has exactly 6 runs.at n=22A043621
- Primes associated with groups in A076077.at n=29A076076
- Prime sums of 5 positive 5th powers.at n=38A123034
- Primes congruent to 11 mod 53.at n=39A142541
- Primes congruent to 14 mod 59.at n=35A142741
- Primes congruent to 42 mod 61.at n=31A142840
- Indices of record values in A046641.at n=49A145772
- 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, -1, 1), (-1, 1, -1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151104
- Primes p such that all the digits needed to write the consecutive Primes from 2 to p fill exactly a square (no holes, no overlaps).at n=22A158024
- Partial sums of A049486.at n=29A174655
- A positive integer n is included if n, when written in binary, is made of run-lengths (lengths of runs of 0's as well as of runs of 1's) that form a permutation of some number of consecutive positive integers starting with 1.at n=40A175061
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}.at n=40A209993
- Numbers n such that (17^n - 2^n)/15 is prime.at n=5A225807
- Primes that are exactly between the nearest square and the nearest triangular number.at n=14A233443
- Primes of the form 10n^2 - 90n + 163.at n=25A256376
- Primes p for which the greatest common divisor of 2^p+1 and 3^p+1 is greater than 1.at n=41A260674
- Construct a square spiral: a(n) is the sum of all adjacent terms a(k) in the spiral for k < n; a(1) = 0, a(2) = 1.at n=45A358429
- Numbers k such that A361338(k) = 9.at n=32A361348
- a(n) is the largest integer k such that there is an integer m with exactly n nonunitary prime factors and m + A005117(i) is squarefree for 1 <= i <= k.at n=18A390138