3421
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3744
- Proper Divisor Sum (Aliquot Sum)
- 323
- 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
- 3100
- Möbius Function
- 1
- Radical
- 3421
- 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
- 56
- 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 protruded partitions of n with largest part at most 2.at n=14A005403
- a(n) = n^3 + 3*n + 1.at n=15A005491
- Pseudoprimes to base 6.at n=13A005937
- Number of 5-leaf rooted trees with n levels.at n=10A007715
- Positive integers n such that 2^n == 2^11 (mod n).at n=46A015935
- Pseudoprimes to base 36.at n=28A020164
- Pseudoprimes to base 52.at n=17A020180
- Pseudoprimes to base 95.at n=18A020223
- Strong pseudoprimes to base 36.at n=8A020262
- Strong pseudoprimes to base 95.at n=3A020321
- Number of 2's in n-th term of A006711.at n=32A022478
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=40A023182
- Numerator of Sum_{p prime, p-1|n} 1/p.at n=23A027759
- Numerator of Sum_{p prime, p-1|n} 1/p.at n=11A027759
- Numerator of sum_{p prime, p-1 divides 2*n} 1/p.at n=5A027761
- Numerator of sum_{p prime, p-1 divides 2*n} 1/p.at n=11A027761
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 15 (most significant digit on right).at n=14A029508
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=26A030299
- Least k such that A033178(k)=n.at n=35A038004
- Smallest k>1 such that k(p-1)-1 is divisible by p^2, p=n-th prime.at n=16A039914