17402
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32832
- Proper Divisor Sum (Aliquot Sum)
- 15430
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 1
- Radical
- 17402
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 79
- 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
- T(2n+1,n+1), T given by A026769.at n=7A026887
- Numbers k such that the decimal part of k^(1/10) starts with a 'nine digits' anagram.at n=7A034285
- 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), (0, 1, 0), (1, 0, 0)}.at n=10A149810
- a(n) = 36*n^2 - n.at n=21A157286
- a(n) = 144*n^2 - 2*n.at n=10A158135
- a(n) = 484*n^2 - 22.at n=5A158627
- Number of binary strings of length n with equal numbers of 00001 and 10100 substrings.at n=15A164206
- a(n) = (sum of first n primes) * n.at n=21A167214
- Triangle read by rows: T(n,k) is the number of up-down permutations of {1,2,...,n} having genus k (see first comment for definition of genus).at n=47A178516
- Number of (w,x,y,z) with all terms in {0,...,n} and 2w-x=max{w,x,y,z}-min{w,x,y,z}.at n=32A212756
- Indices of primes in the tribonacci-like sequence, A214825.at n=26A230016
- Smallest even number k such that lpf(k-3) = prime(n) while lpf(k-1) > lpf(k-3), where lpf=least prime factor (A020639).at n=29A242490
- Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639).at n=28A242720
- Smallest even k such that the pair {k-3,k-1} is not a twin prime pair and lpf(k-1) > lpf(k-3) >= prime(n), where lpf = least prime factor (A020639).at n=29A242720
- Number of length n+3 0..7 arrays with no four elements in a row with pattern abba (with a!=b) and new values 0..7 introduced in 0..7 order.at n=5A243388
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=34A244412
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=35A244412
- Least even k such that sfdf(k-1) > sfdf(k-3) >= A050376(n), where sfdf(n) is the smallest Fermi-Dirac factor of n (A223490), and k-3 is not the lesser of a pair of Fermi-Dirac twin primes (A229064).at n=36A244412
- Expansion of Product_{k>=1} (1 - k*x^k) / (1 + x^k).at n=44A269339
- Number of nX5 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=19A317770