1758
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3528
- Proper Divisor Sum (Aliquot Sum)
- 1770
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 584
- Möbius Function
- -1
- Radical
- 1758
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 148
- 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 T4 for Zeolite Code AET.at n=29A008010
- Coordination sequence T2 for Zeolite Code APC.at n=29A008033
- Coordination sequence T2 for Zeolite Code LTL.at n=31A008139
- Coordination sequence T1 for Zeolite Code LTN.at n=29A008140
- Coordination sequence T2 for Milarite.at n=26A008257
- Year of birth of n-th President of U.S.A.at n=4A008745
- Coordination sequence T4 for Zeolite Code RTH.at n=29A009896
- Number of 7-ary search trees on n keys.at n=13A019501
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).at n=37A024696
- a(n) = Sum_{k=1..n} k*floor(n/k); also Sum_{k=1..n} sigma(k) where sigma(n) = sum of divisors of n (A000203).at n=45A024916
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=23A025491
- a(n) = n-th largest even number in array T given by A027170.at n=31A027183
- a(n) = (n+3)^2 - 6.at n=39A028878
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 12.at n=48A031510
- Numbers whose base-5 expansions have 5 distinct digits.at n=42A031946
- Numbers k such that 247*2^k+1 is prime.at n=15A032500
- If d,e are consecutive digits of n in base 7, then |d-e|>=5.at n=22A032995
- Numbers whose base-12 representation has the same nonzero number of 0's and 6's.at n=42A039498
- Matrix 4th power of partition triangle A008284.at n=46A039806
- a(n)=(s(n)+2)/7, where s(n)=n-th base 7 palindrome that starts with 5.at n=22A043063