3451
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4320
- Proper Divisor Sum (Aliquot Sum)
- 869
- 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
- 2688
- Möbius Function
- -1
- Radical
- 3451
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- 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
- a(n) is the number of conjugacy classes in the alternating group A_n.at n=30A000702
- Number of strict first-order maximal independent sets in cycle graph.at n=28A007391
- Coordination sequence T1 for Banalsite.at n=35A008249
- Pseudoprimes to base 86.at n=27A020214
- Index of 9^n within the sequence of the numbers of the form 2^i*9^j.at n=46A025734
- Lucky numbers with size of gaps equal to 12 (upper terms).at n=39A031895
- Second 10-gonal (or decagonal) numbers: n*(4*n+3).at n=29A033954
- Zeckendorf expansion of n: repeatedly subtract the largest Fibonacci number you can until nothing remains. Big-endian concatenation of decimals.at n=40A035514
- A summarize Fibonacci sequence starting with a(0)=4 and a(1)=1: summarize the previous two terms!.at n=4A036115
- Numerators of continued fraction convergents to sqrt(870).at n=2A042680
- Numbers n such that string 5,1 occurs in the base 10 representation of n but not of n-1.at n=37A044383
- Numbers n such that string 5,1 occurs in the base 10 representation of n but not of n+1.at n=37A044764
- Composite numbers not divisible by 2, 3 or 5 which contain their largest prime factor as a substring in base 2.at n=24A063137
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 59 ).at n=24A063332
- Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).at n=14A064125
- Number of partitions of n into odious numbers (A000069).at n=44A067590
- Numbers n such that phi(n)^2 + sigma(n)^2 is an integer square.at n=41A067811
- Number of permutations satisfying i-3<=p(i)<=i+4, i=1..n.at n=7A072854
- a(1) = 4, a(n+1) is the smallest composite number > a(n) such that all of the differences a(n+1)-a(n) are distinct primes.at n=42A073679
- Sum of terms of n-th row of A077583.at n=38A077660