3509
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
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 3990
- Proper Divisor Sum (Aliquot Sum)
- 481
- 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
- 3080
- Möbius Function
- 0
- Radical
- 319
- Omega Function (Ω)
- 3
- 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
- 56
- 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
- Number of partitions of at most n into at most 5 parts.at n=27A002622
- a(n) = A026618(2*n, n-2).at n=5A026618
- a(1) = 1; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=35A033680
- Let F(n) = Q(n) - P(n) be the Fortunate numbers (A005235); sequence gives n such that F(n) = prime(n+1).at n=15A035346
- Numbers having three 6's in base 8.at n=23A043447
- Numbers k such that the string 0,9 occurs in the base 10 representation of k but not of k-1.at n=37A044341
- Numbers n such that string 0,9 occurs in the base 10 representation of n but not of n+1.at n=37A044722
- Numbers n such that string 5,0 occurs in the base 10 representation of n but not of n+1.at n=38A044763
- Coordination sequence T1 for Zeolite Code MSO.at n=41A047963
- Numbers k such that k and k-1 both have 6 divisors.at n=38A049104
- Numbers where the difference of consecutive fifth powers is "close" to another fifth power: let m = k^5 - (k-1)^5; sequence lists the numbers k where m - floor(m^(1/5))^5 < floor(sqrt(k))^5.at n=1A053804
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=5A071861
- Numbers k such that k^2 is a term of A072510.at n=44A072327
- Number of partitions of n into distinct and relatively prime parts.at n=49A078374
- Numbers k such that bigomega(k!)/omega(k!) is an integer.at n=34A088533
- a(n) = least k such that the remainder when 19^k is divided by k is n.at n=39A128159
- Numbers (excluding primes and powers of primes) such that the square mean of their prime factors is an integer (where the square mean of c and d is sqrt((c^2+d^2)/2)).at n=31A134603
- Numbers (excluding primes and powers of primes) such that the square mean of their prime factors is a prime (where the square mean of c and d is sqrt((c^2+d^2)/2)).at n=20A134604
- Scaled convolution of (n^3)*A000984(n) with A000984(n).at n=10A142962
- Minimal exponents m such that the fractional part of (10/9)^m obtains a maximum (when starting with m=1).at n=11A153695