9139
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10640
- Proper Divisor Sum (Aliquot Sum)
- 1501
- 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
- 7776
- Möbius Function
- -1
- Radical
- 9139
- 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
- yes
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 34
- 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
- Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.at n=37A000292
- a(n) = 1^2 + 3^2 + 5^2 + 7^2 + ... + (2*n-1)^2 = n*(4*n^2 - 1)/3.at n=19A000447
- Binomial coefficient C(3n,n-10).at n=3A004328
- Dodecahedral numbers: a(n) = n*(3*n - 1)*(3*n - 2)/2.at n=13A006566
- Binomial coefficient C(39,n).at n=3A010955
- Binomial coefficient C(n,36).at n=3A010989
- Odd tetrahedral numbers: a(n) = (4*n+1)*(4*n+2)*(4*n+3)/6.at n=9A015219
- Pseudoprimes to base 75.at n=42A020203
- a(n) = n*(27*n + 1)/2.at n=26A022285
- (prime(n)-5)(prime(n)-7)(prime(n)-9)/48.at n=20A030002
- a(n) = (prime(n) - 1)*(prime(n) - 3)*(prime(n) - 5)/48.at n=20A030004
- Numerator of n*(n-1)*(n-2)/720.at n=39A051726
- Numbers k such that phi(k)/lambda(k) increases to a record value, where phi(k) is the Euler totient function (A000010) and lambda(k) is the Carmichael lambda function (A002322).at n=15A066605
- a(n) = lcm(n, n+1, n+2)/6.at n=36A067046
- Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).at n=33A068372
- Squarefree tetrahedral numbers.at n=12A070755
- Numbers k such that phi(k) is a perfect 5th power.at n=25A078165
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=26A078970
- a(n) = binomial(n, smallest prime factor of n).at n=38A080211
- Binomial(n, smallest odd prime factor of n).at n=38A080212