4653
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 2835
- 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
- 2760
- Möbius Function
- 0
- Radical
- 1551
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 152
- 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
- Expansion of x^3*(5-2*x)*(1-x^3)/(1-x)^4.at n=31A000338
- a(n) = Sum_{k=0..n} binomial(n,k)^2 * binomial(2*k,k).at n=5A002893
- Let j = | i - i_written_backwards |, k = j + j_written_backwards; then k is in this sequence.at n=30A008920
- Numbers k such that sigma(k) = sigma(k+12).at n=30A015882
- a(n) = A027082(n, 2n-4).at n=8A027091
- Lucky numbers that are decimal concatenations of n with n + 7.at n=4A032657
- a(n) = n*(2*n+5).at n=47A033537
- Multiplicity of highest weight (or singular) vectors associated with character chi_4 of Monster module.at n=45A034392
- Number of partitions of n into parts not of the form 21k, 21k+6 or 21k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=30A035984
- G.f.: 1/((1-x)*(1-x^2))^3.at n=17A038163
- Numbers having four 3's in base 6.at n=10A043384
- Numbers k such that 31*2^k-1 is prime.at n=20A050541
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=26A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=23A057950
- Expansion of (3+x)/(1-x)^6.at n=8A059599
- The floor[n^(3/4)]-perfect numbers, where f-perfect numbers for an arithmetical function f is defined in A066218.at n=19A066363
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=4A072435
- Sums of members of groups in A076063.at n=20A076066
- a(n) = Min{x : A073124(x) = 2n}.at n=39A096480
- Values of k for which 7m+1, 8m+1 and 11m+1 are prime, with m = 1848k + 942.at n=41A101186