3664
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 7130
- Proper Divisor Sum (Aliquot Sum)
- 3466
- 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
- 1824
- Möbius Function
- 0
- Radical
- 458
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 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 graphs with n nodes and n-1 edges.at n=10A001433
- Squares written in base 7.at n=36A002440
- a(n) = 1000*log(n) rounded to the nearest integer.at n=38A004241
- a(n) = Sum_{k=1..n-1} lcm(k,n-k).at n=32A006580
- Coordination sequence T1 for Zeolite Code MEL.at n=39A008150
- Coordination sequence T3 for Zeolite Code MTN.at n=36A008188
- Define the sequence S(a(0),a(1)) by a(n+2) is the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n) for n >= 0. This is S(5,45).at n=3A022022
- Numbers whose set of base-15 digits is {1,4}.at n=17A032827
- Every run of digits of n in base 15 has length 2.at n=17A033013
- Numbers whose base-15 expansion has no run of digits with length < 2.at n=32A033028
- Composite numbers whose prime factors contain no digits other than 2 and 9.at n=23A036313
- a(n)=(s(n)+4)/9, where s(n)=n-th base 9 palindrome that starts with 5.at n=22A043076
- Positive integers with more base-15 runs of even length than odd.at n=18A044841
- Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.at n=28A060463
- a(n) = n^2 * Sum_{primes p dividing n} (1 + 1/p^2).at n=39A065969
- Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.at n=6A085844
- Numbers m such that pi(m) = d_1^1 + d_2^2 + ... + d_k^k where d_1 d_2 ... d_k is the decimal expansion of m.at n=5A112719
- Number of dissimilar squarefree quaternary words of length n.at n=10A118311
- Expansion of q / (chi(-q) * chi(-q^11))^2 in powers of q where chi() is a Ramanujan theta function.at n=23A123631
- Real part of the smallest Gaussian prime having a gap size of exactly A128106(n).at n=13A128107