6241
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
- 3
Divisibility
- Divisor Count
- 3
- Divisor Sum
- 6321
- Proper Divisor Sum (Aliquot Sum)
- 80
- 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
- 6162
- Möbius Function
- 0
- Radical
- 79
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- yes
- 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
- 49
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- no
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of (sin x + cos x)/cos 4x.at n=5A000813
- Squares of primes.at n=21A001248
- Pentagonal numbers written backwards.at n=31A004163
- Sum of squares of primes = 1 mod 3 dividing n.at n=78A005071
- Sum of squares of primes = 3 mod 4 dividing n.at n=78A005083
- Number of alternating 4-signed permutations.at n=5A006873
- Number of partitions of n into partition numbers.at n=51A007279
- Numbers m such that phi(m) * sigma(m) + k^2 is not a square for any k.at n=26A015713
- Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers.at n=39A016754
- a(n) = (3*n+1)^2.at n=26A016778
- a(n) = (4n + 3)^2.at n=19A016838
- a(n) = (5*n + 4)^2.at n=15A016898
- a(n) = (6*n + 1)^2.at n=13A016922
- a(n) = (7*n+2)^2.at n=11A017006
- a(n) = (8*n + 7)^2.at n=9A017150
- a(n) = (9*n + 7)^2.at n=8A017246
- a(n) = (10*n + 9)^2.at n=7A017378
- a(n) = (11*n + 2)^2.at n=7A017414
- a(n) = (12*n + 7)^2.at n=6A017606
- Pseudoprimes to base 31.at n=26A020159