3475
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 4340
- Proper Divisor Sum (Aliquot Sum)
- 865
- 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
- 695
- 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
- 105
- 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
- Greatest k such that binomial(k,n) has fewer than n distinct prime factors.at n=27A005735
- Coordination sequence T2 for Zeolite Code AFS.at n=45A008024
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (primes).at n=51A024377
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (primes).at n=50A025077
- Numbers k such that 125*2^k+1 is prime.at n=18A032412
- Numbers n such that string 7,5 occurs in the base 10 representation of n but not of n-1.at n=37A044407
- Numbers n such that string 7,5 occurs in the base 10 representation of n but not of n+1.at n=37A044788
- Number of increasing rooted trees with a forbidden limb of length 3.at n=8A052324
- G.f. A(x) satisfies: A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^k)^5 * x^k / k ).at n=5A052798
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=37A056219
- a(n) = least value such that sequence increases and pairwise differences are unique.at n=44A058335
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=19A064602
- Total number of even parts in all partitions of n.at n=22A066898
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the first term of each group.at n=39A074125
- Smallest multiple of the n-th prime beginning with n.at n=33A078209
- Number of partitions of n such that the set of parts has an even number of elements.at n=31A092306
- TrueSoFar terminating terms in other bases.at n=6A102843
- Arithmetic mean of two consecutive balanced primes (of order one).at n=30A126554
- a(n)=(1+2^(1/3))^n.at n=10A128812
- Positions of 14 after decimal point in decimal expansion of Pi.at n=43A134214