3762
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
- 24
- Divisor Sum
- 9360
- Proper Divisor Sum (Aliquot Sum)
- 5598
- 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
- 1080
- Möbius Function
- 0
- Radical
- 1254
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 38
- 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
- Number of bicentered trees with n nodes.at n=15A000677
- Number of combinatorial types of simplicial n-dimensional polytopes with n+3 nodes.at n=13A000943
- a(n) is the sum of products of terms in all partitions of n.at n=13A006906
- Coordination sequence T1 for Zeolite Code ATT.at n=44A008041
- Coordination sequence T4 for Zeolite Code GOO.at n=42A008114
- Aliquot sequence starting at 138.at n=8A008888
- Aliquot sequence starting at 150.at n=7A008889
- Aliquot sequence starting at 168.at n=5A008890
- Let j = | i - i_written_backwards |, k = j + j_written_backwards; then k is in this sequence.at n=28A008920
- a(n) = floor(n*(n-1)*(n-2)/17).at n=41A011899
- Expansion of 1/((1-x)(1-4x)(1-5x)(1-11x)).at n=3A021784
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-9).at n=19A023439
- 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 60.at n=15A031558
- Every run of digits of n in base 5 has length 2.at n=21A033003
- Coordination sequence T5 for Zeolite Code CFI.at n=41A033603
- Number of partitions of n into parts 4k+1 and 4k+2 with at least one part of each type.at n=45A035624
- Number of partitions of n into parts not of the form 23k, 23k+9 or 23k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=28A035997
- Number of anagrams of A046888(n) that are primes.at n=55A046889
- Revert transform of 1 - x - x^3.at n=8A049140
- Partial sums of A050406.at n=5A052254