17143
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20480
- Proper Divisor Sum (Aliquot Sum)
- 3337
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14040
- Möbius Function
- -1
- Radical
- 17143
- 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
- 172
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 8^n-n^6.at n=5A024094
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=26A036260
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 2,1,1.at n=5A037555
- Values of A038005 ending in 3.at n=19A038013
- Numbers ending with '3' that are the difference of two positive cubes.at n=34A038858
- Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.at n=16A074482
- Consider the recursion b(1,n) = 1, b(k+1,n) = b(k,n) + (b(k,n) reduced mod(k+n)); then there is a number x such that b(k,n) - b(k-1,n) is a constant x depending only on n, for k > y = A074483(n). Sequence gives values of x.at n=67A074482
- 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, 0), (-1, 1, -1), (0, 1, 0), (1, 0, 1), (1, 1, 0)}.at n=7A151113
- Products of three distinct happy primes A035497.at n=23A154717
- The coefficient of t^n in the power series solution of u in the equation -t+(1-t+t^2+t^3)*u-(t+t^4)*u^2+(t^3+t^5)*u^3-t^4*u^4=0.at n=18A190591
- Monotonic ordering of nonnegative differences 8^i-5^j, for 40>= i>=0, j>=0.at n=16A192198
- Positions of 3's in A234323.at n=39A234804
- Consider a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the arithmetic derivative of x.at n=18A269312
- Number of "Euclidean primes" with respect to the first n primes.at n=17A283936
- Numbers k such that k!6 + 6 is prime, where k!6 is the sextuple factorial number (A085158 ).at n=21A287956
- Number of sets of nonempty words with a total of n letters over septenary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=10A293746
- Odd numbers m such that sigma(x) = m has more than 1 solution.at n=11A300869
- a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n).at n=32A362198
- Number of integer partitions of n whose first differences are not all distinct.at n=36A389919