9170
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
- 16
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 9838
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 1
- Radical
- 9170
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 153
- 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
- Expansion of e.g.f.: sec(arctan(x)*exp(x))=1+1/2!*x^2+6/3!*x^3+21/4!*x^4+100/5!*x^5...at n=7A012418
- Number of parts in all partitions of n into distinct parts.at n=43A015723
- a(n) = n*(15*n - 1)/2.at n=35A022272
- Numbers with exactly 4 distinct palindromic prime factors.at n=18A046402
- Determinant of the n X n matrix whose element (i,j) equals the floor( Phi^(i-j) + 1).at n=42A071784
- Sum of squares of digits of n is equal to the largest prime factor of n.at n=24A074302
- Number of 5 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=6A086115
- Numbers n for which there are exactly six k such that n = k + (product of nonzero digits of k).at n=2A096927
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=29A101243
- Least positive k such that k * [RSA-640]^n - 1 is prime, where RSA-640 is the 193 decimal digit RSA challenge number A391940(14).at n=12A108573
- Numbers n such that the numerator of BernoulliB[n] is divisible by 691.at n=32A119864
- Positions at which the sum of the digits of e up to that point equals the sum of the digits of Pi up to that point.at n=19A131660
- 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, 0, 0), (0, 0, -1), (0, 0, 1), (1, 1, 1)}.at n=7A150759
- Composite numbers such that exactly ten distinct permutations of digits are prime.at n=30A163562
- a(n) = n*(2*n^2 + 5*n + 17)/2.at n=20A163661
- Number of reduced, normalized 3 X 3 semimagic squares with distinct nonnegative integer entries and maximum entry n.at n=45A173724
- Number of (n+2) X 7 binary arrays avoiding patterns 001 and 110 in rows and columns.at n=2A202049
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 110 in rows and columns.at n=23A202052
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 110 in rows and columns.at n=25A202052
- n - (sum of prime factors of n) is a positive square.at n=40A216894