3483
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
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 5324
- Proper Divisor Sum (Aliquot Sum)
- 1841
- 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
- 2268
- Möbius Function
- 0
- Radical
- 129
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 87
- 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
- Difference between A000294 and the number of solid partitions of n (A000293).at n=16A007326
- Size of lexicographic code of length n, Hamming distance 6 and weight 6.at n=34A031504
- 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 59.at n=0A031557
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 59.at n=0A031737
- Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Big-endian concatenation of decimals.at n=45A035514
- Composite numbers whose prime factors contain no digits other than 3 and 4.at n=12A036314
- Number of 6-ary rooted trees with n nodes and height at most 5.at n=13A036622
- Expansion of (1+3*x^2+7*x^3+15*x^4+13*x^5+15*x^6+8*x^7+4*x^8)/((1-x)*(1-x^2)^3*(1-x^3)^2).at n=12A037241
- Coordination sequence T14 for Zeolite Code STT.at n=39A038430
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 10.at n=45A038641
- Numbers n such that string 8,3 occurs in the base 10 representation of n but not of n-1.at n=37A044415
- Numbers k such that string 8,3 occurs in the base 10 representation of k but not of k+1.at n=37A044796
- Odd numbers divisible by exactly 5 primes (counted with multiplicity).at n=34A046318
- Number of ways to write n as an lterm, where an lterm is an unordered sum which is either 2, or 1 + an ordered product of lterms.at n=52A050366
- Number of ways to write n as an lterm, where an lterm is an unordered sum which is either 2, or 1 + an ordered product of lterms.at n=51A050366
- Intrinsic 12-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=22A060949
- Stirling interpolation of f'(x) by (2n+1)-st differences.at n=7A061027
- p^2 + 2 where p is a prime.at n=16A061725
- a(n) = 2*n^2 + 11*n + 12.at n=40A071355
- Positions of check bits in code in A075931.at n=37A075933