9729
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 5247
- 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
- 6072
- Möbius Function
- 0
- Radical
- 3243
- Omega Function (Ω)
- 4
- 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
- 166
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = floor( n*(n-1)*(n-2)/10 ).at n=47A011892
- Numbers that are the sum of 3 positive cubes in exactly 3 ways.at n=1A025397
- Numbers that are the sum of 3 positive cubes in 3 or more ways.at n=1A025398
- Numbers that are the sum of 3 distinct positive cubes in exactly 3 ways.at n=1A025401
- Numbers that are the sum of 3 distinct positive cubes in 3 or more ways.at n=1A025402
- The transformation of A059032 applied to 1, 1, 1, 1, ...at n=6A059037
- Triangle in A059037 read by rows from left to right.at n=21A059038
- Triangle in A059037 read by rows in natural order.at n=27A059039
- a(n) is the concatenation of n with n^3.at n=8A061086
- Integer part of the blowup factor for A025587(n).at n=11A061523
- a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term.at n=9A069565
- a(n) = 512*n + 1.at n=19A076338
- (-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n).at n=61A086394
- Convoluted convolved Fibonacci numbers G_7^(r).at n=15A089113
- Sign twisted convoluted convolved Fibonacci numbers H_7^(r).at n=15A089114
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 81.at n=2A093281
- Numbers n such that googol - n is prime.at n=36A108251
- Where records occur in A111390.at n=42A114111
- Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=23A124141
- a(n) = 256*n + 1.at n=37A158231