9499
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 2021
- 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
- 7656
- Möbius Function
- -1
- Radical
- 9499
- 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
- 104
- 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) = n*(9*n - 1)/2.at n=46A022266
- a(n+1) = a(n) converted to base 8 from base 7 (written in base 10).at n=34A023388
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=18A024475
- Nearest integer to n^(5/2).at n=39A036488
- Numbers having three 9's in base 10.at n=13A043527
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=26A045213
- McKay-Thompson series of class 42d for Monster.at n=48A058678
- Sum of primes dividing Fibonacci(n) (with repetition).at n=37A064725
- Sum of prime factors of Fibonacci(n).at n=37A080648
- 3-almost primes with semiprime digits (digits 4, 6, 9 only).at n=23A111494
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+833)^2 = y^2.at n=25A129010
- Products of 3 distinct safe primes.at n=24A157354
- Numbers n that are multiples of the reversal of n+1.at n=5A160946
- Number of symmetry classes of 3 X 3 magilatin squares with positive values and magic sum n.at n=45A173730
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,3,0,1,0 for x=0,1,2,3,4.at n=4A197746
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,3,0,1,0 for x=0,1,2,3,4.at n=3A197747
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,1,0 for x=0,1,2,3,4.at n=31A197750
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,3,0,1,0 for x=0,1,2,3,4.at n=32A197750
- Composite squarefree numbers n such that p(i)-5 divides n+5, where p(i) are the prime factors of n.at n=9A225705
- Numbers k such that Phi(k, 12) is prime, where Phi is the cyclotomic polynomial.at n=54A252353