3358
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
- 8
- Divisor Sum
- 5328
- Proper Divisor Sum (Aliquot Sum)
- 1970
- 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
- 1584
- Möbius Function
- -1
- Radical
- 3358
- 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
- 87
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T6 for Zeolite Code DFO.at n=44A009880
- Sum of squares of the first n primes.at n=10A024450
- a(n) = n-th largest even number in array T given by A027170.at n=46A027183
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 5).at n=39A035563
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=29A039879
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n-1.at n=36A044390
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n+1.at n=36A044771
- Numbers k such that k^12 == 1 (mod 13^3).at n=19A056086
- Numbers n such that n | 9^n + 8^n + 1.at n=11A057296
- Coordination sequence T7 for Zeolite Code SFE.at n=38A057323
- Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists.at n=22A069554
- a(1)=1; a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.at n=19A071183
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=8A075605
- Smallest k not a palindrome and not divisible by 10 such that k and R(k) both are divisible by n, or 0 if n is divisible by 10.at n=22A075606
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=35A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=34A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=33A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=32A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=31A081738
- a(n) = Sum_{2 <= p <= n, p prime} p^2.at n=30A081738