4644
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12320
- Proper Divisor Sum (Aliquot Sum)
- 7676
- 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
- 1512
- Möbius Function
- 0
- Radical
- 258
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 183
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = round(1000*log_2(n)).at n=24A004266
- a(n) = ceiling(1000*log_2(n)).at n=24A004267
- Number of restricted 3 X 3 matrices with row and column sums n.at n=36A005045
- States of a dynamic storage system.at n=12A005595
- Coordination sequence T2 for Zeolite Code MOR.at n=44A008183
- "Pascal sweep" for k=8: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=58A009522
- a(n)-th prime is sum of first k primes for some k.at n=16A020641
- Numbers k such that 21*2^k+1 is prime.at n=24A032360
- Expansion of (1/(1-x^2))*Product_{m>=0} 1/(1-x^(2m+1)).at n=40A038348
- Numbers having three 4's in base 10.at n=27A043507
- Numbers k such that k^2 is expressible as the sum of two positive cubes in at least one way.at n=44A050801
- Numbers whose 5th power is expressible as the sum of two positive cubes.at n=45A051394
- Multiples of 9 having only even digits.at n=37A061831
- Numbers k such that sigma(k) = 2*usigma(k).at n=13A063880
- Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=18A065159
- Number of fixed hexagonal polyominoes with n cells and tree-like structure.at n=7A066331
- Number of partitions of n such that the least part occurs with odd multiplicity.at n=31A096375
- G.f.: (1+x^8+x^9+x^10+x^18)/((1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)).at n=51A097851
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and height k (n>=0, k>=0).at n=45A097862
- Least k such that (k*Mersenne-prime(n))^2 + 1 is prime.at n=20A098774