9017
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9216
- Proper Divisor Sum (Aliquot Sum)
- 199
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8820
- Möbius Function
- 1
- Radical
- 9017
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 39
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Divisors of 2^35 - 1.at n=6A003542
- Strong pseudoprimes to base 32.at n=18A020258
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=14A036260
- Digitally balanced numbers in both bases 2 and 3.at n=29A049361
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=18A066696
- Least nontrivial multiple of the n-th prime beginning with 9.at n=30A078293
- Divide primes in groups with 2n+1 elements and add together.at n=9A109725
- a(0)=1, a(n+1) = 5*a(n)-4*A117641(n) for n>=0.at n=7A126952
- Number of different values of i^2+j^2+k^2+l^2+m^2 for i,j,k,l,m in [0,n].at n=45A132432
- a(n) = 392*n + 1.at n=23A158002
- a(n) = 46*n^2 + 1.at n=14A158632
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=27A163562
- Totally multiplicative sequence with a(p) = a(p-1) + 7 for prime p.at n=34A166704
- Smallest sequence which lists the position of digits "8" in the sequence.at n=49A167450
- Riordan array (f(x), x*g(x)), f(x) is the g.f. of A126952, g(x) is the g.f. of A117641.at n=28A171243
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7 and 16*k-15 are also products of two distinct primes.at n=37A177213
- Semiprimes which are the sum of three distinct positive cubes in two or more distinct ways.at n=9A180089
- a(n) = Sum_{k=1..n} binomial(2*k, n-k)^2 * n/k.at n=6A198059
- Number of (w,x,y,z) with all terms in {0,...,n} and w=max{w,x,y,z}-2*min{w,x,y,z}.at n=17A212745
- Numbers n such that A = n - digitsum(n) is divisible by the largest power of 10 <= A.at n=36A242474