17022
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 34056
- Proper Divisor Sum (Aliquot Sum)
- 17034
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5672
- Möbius Function
- -1
- Radical
- 17022
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 203
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=37A025005
- Digitally balanced numbers in base 4: equal numbers of 0's, 1's, ... 3's.at n=26A049355
- Number of primes less than 10^n containing only the digits 2 and 3 (A020458).at n=17A069749
- Numbers k such that k*((2^61-1)^2) - 1 and k*((2^61-1)^2) + 1 are twin primes.at n=5A099229
- Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the symmetric matrix A203001; by antidiagonals.at n=24A203002
- Least k such that k*6^n-1 , k*6^n+1, and 2*k*6^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=29A212481
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=22A229422
- Number of (n+1) X (2+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=1A234492
- T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).at n=4A234497
- Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=47A240178
- Numbers k such that (56*10^k - 47)/9 is prime.at n=19A286435
- Number of Evolutionary Duplication-Loss-histories with n leaves of the caterpillar species tree with 3 leaves.at n=4A307697
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=26A331454
- Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=46A382232
- Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=55A382232
- Distinct terms in A386369.at n=12A385254
- a(n) is the number of five element sets of distinct integer-sided trapezoids whose base angles are 60 degrees that fill an equilateral triangular grid of side n units.at n=19A391498