3679
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3976
- Proper Divisor Sum (Aliquot Sum)
- 297
- 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
- 3384
- Möbius Function
- 1
- Radical
- 3679
- Omega Function (Ω)
- 2
- 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
- 162
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of simple imperfect squared squares of order n up to symmetry.at n=23A002962
- Number of fountains of n coins.at n=17A005169
- Coordination sequence T1 for Zeolite Code BOG.at n=43A008049
- Coordination sequence T6 for Zeolite Code DDR.at n=38A008076
- Coordination sequence T1 for Zeolite Code LEV.at n=45A008127
- Coordination sequence T1 for Zeolite Code AHT.at n=41A009866
- Number of partitions of 4^n into n-th powers.at n=8A027601
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).at n=76A036876
- Related to enumeration of edge-rooted catafusenes.at n=13A039658
- Coordination sequence T1 for Zeolite Code DON.at n=41A047953
- First differences of A052829.at n=9A052870
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=22A060630
- Numbers k such that floor(k*e) is a square.at n=35A062268
- Numbers n such that n and its reversal are both multiples of 13.at n=21A062903
- Non-palindromic number and its reversal are both multiples of 13.at n=11A062912
- Semiprimes p1*p2 such that p2 mod p1 = 10, with p2 > p1.at n=24A064908
- Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=9A077405
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)at n=43A083992
- a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n).at n=21A096461
- Pythagorean years: a Pythagorean year is one whose digits partition into two disjoint sets such that, considering digital sums, the Pythagorean relation 5^2=4^2 + 3^2 is evinced.at n=33A101039