4932
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
- 3
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 12558
- Proper Divisor Sum (Aliquot Sum)
- 7626
- 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
- 1632
- Möbius Function
- 0
- Radical
- 822
- Omega Function (Ω)
- 5
- 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
- 134
- 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
- Coordination sequence T2 for Zeolite Code DDR.at n=44A008072
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A014306.at n=31A025097
- Expansion of 1/((1-2x)(1-5x)(1-7x)(1-10x)).at n=3A025994
- Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 4 (mod 5).at n=56A035589
- Numbers whose base-3 representation contains exactly four 0's and no 1's.at n=36A044985
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=15A045013
- Number of partitions of n with equal number of parts congruent to each of 0, 2, 3 and 4 (mod 5).at n=60A046774
- Numbers k such that 233*2^k-1 is prime.at n=16A050868
- Coefficients of replicable function number "32b".at n=31A058632
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=25A060672
- Integer part of log(n!)^(1 + log(log(1 + n))).at n=22A062475
- Nearest integer to log(n!)^(1 + log(log(1 + n))).at n=22A062476
- If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=12A064835
- Expansion of 1/((1-x)^2*(1-x^2)^2*(1-x^3)*(1-x^4)^2*(1-x^5)).at n=20A069957
- Smallest difference>1 between d and p/d for any divisor d of the partial product p of the sequence, starting with 9.at n=8A082124
- Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.at n=10A084814
- a(0)=1; a(n) = sigma_1(n) + sigma_3(n).at n=17A092345
- Number of partitions of n into parts not greater than floor(log_2(n)).at n=54A097355
- Number of positive words of length n in the monoid Br_9 of positive braids on 10 strands.at n=5A097556
- Numbers n such that 9*10^n + 5*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A103100