4634
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7968
- Proper Divisor Sum (Aliquot Sum)
- 3334
- 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
- 1980
- Möbius Function
- -1
- Radical
- 4634
- 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
- 33
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers that are the sum of 8 positive 7th powers.at n=19A003375
- Shifts left under OR-convolution with itself.at n=9A007460
- Coordination sequence T3 for Zeolite Code AET.at n=47A008009
- Coordination sequence T1 for Zeolite Code -CHI.at n=43A009846
- Coordination sequence T1 for Zeolite Code VSV.at n=43A009914
- Numbers whose sum of reciprocals of digits is the reciprocal of an integer.at n=46A037264
- Sum of reciprocals of digits = 1.at n=28A037268
- The sequence e, given that c is a left shift by one place of b.at n=59A041003
- Numbers n such that n^2 contains exactly 8 different digits.at n=17A054036
- Triangle T(n,k) giving number of 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2).at n=61A059683
- Harmonic mean of digits is 4.at n=30A062182
- Number of partitions of n with zero crank.at n=45A064410
- Final terms of rows in A077341.at n=45A077343
- a(n) = a(n-1) + a(n-2) + a(n-4) with a(0) = 2, a(1) = 3, a(2) = 6, a(3) = 9.at n=14A095982
- {Sum of all k-digit numbers > n }-{sum of all k-digit numbers < n}, n is a 'k'digit number.at n=18A109644
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=44A114580
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k valleys strictly above the x-axis (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1.at n=57A119011
- Number of 8-almost primes 8ap such that 2^n < 8ap <= 2^(n+1).at n=18A120039
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=32A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=18A125756