9963
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
- 15288
- Proper Divisor Sum (Aliquot Sum)
- 5325
- 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
- 6480
- Möbius Function
- 0
- Radical
- 123
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Define the sequence S(a(0),a(1)) by a(n+2) is the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n) for n >= 0. This is S(3,15) (agrees with A019478 only for n <= 23).at n=5A019477
- a(n) = 5*a(n-1) + a(n-2) - 3*a(n-3).at n=5A019478
- Triangle read by rows: 4th power of the lower triangular mean matrix (M[i,j] = 1/i for i <= j).at n=13A027448
- Second diagonal of A027448.at n=3A027455
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 99.at n=14A031597
- Number of reversible strings with n beads of 3 colors.at n=9A032120
- Odd numbers divisible by exactly 6 primes (counted with multiplicity).at n=32A046319
- (Sum of digits of n)^4 - (sum of digits of n^4).at n=46A069978
- The terms of A055235 (sums of two powers of 3) divided by 2.at n=50A073216
- a(n) = (prime(n)+1)*n - 1.at n=46A083723
- 3 times hexagonal numbers: a(n) = 3*n*(2*n-1).at n=41A094159
- a(n) = A081038(n) + A077616(n).at n=5A094951
- Number of partitions of n such that the least part occurs with odd multiplicity.at n=35A096375
- Number of (1,0) steps in all Grand Motzkin paths of length n.at n=8A109188
- Triangle P, read by rows, that satisfies [P^3](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(3*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(k,k)=1 and P(k+1,1)=P(k+1,0) for k>=0.at n=25A111840
- a(n) = 7 + floor(Sum_{j=1..n-1} a(j) / 2).at n=18A120136
- a(n) is the smallest number m such that the sum of the digits of n+m is n.at n=35A130692
- Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=31A132885
- A007318 * triangle M, where M = A002426 * 0^(n-k), 0<=k<=n.at n=53A135091
- Positive numbers of the form x^5-10x^3*y^2+5x*y^4 (where x,y are integers and y>x).at n=11A135792