2758
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4752
- Proper Divisor Sum (Aliquot Sum)
- 1994
- 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
- 1176
- Möbius Function
- -1
- Radical
- 2758
- 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
- 128
- 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
- From analyzing an algorithm.at n=8A006929
- Coordination sequence T1 for Zeolite Code EPI.at n=33A008090
- Coordination sequence T5 for Zeolite Code MEL.at n=34A008154
- a(n) = n*(7*n + 1)/2.at n=28A022265
- a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {first n+2 primes}.at n=8A024453
- Number of T-frame polyominoes with n cells.at n=34A028247
- Numbers whose set of base 14 digits is {0,1}.at n=10A033050
- Coordination sequence T2 for Zeolite Code SBT.at n=42A033613
- Numbers m with property that rotating digits of m right gives k*m + 1 for some k >= 1.at n=3A034180
- a(n) = n^3 + n.at n=14A034262
- a(n) = floor(T_(n+1)/T_(n)) where T_n is n-th tangential or "Zag" number (see A000182).at n=40A034972
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) <= cn(3,5).at n=62A036870
- Denominators of continued fraction convergents to sqrt(792).at n=3A042527
- Numbers whose base-14 representation has exactly 4 runs.at n=0A043665
- Numbers n such that string 0,4 occurs in the base 9 representation of n but not of n-1.at n=36A044255
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n-1.at n=30A044390
- Numbers n such that string 0,4 occurs in the base 9 representation of n but not of n+1.at n=36A044636
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n+1.at n=30A044771
- Starting from generation 4 add previous and next term yielding generation 5.at n=39A048451
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = 1, a(2) = 2, and a(3) = 1.at n=12A049950