6758
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 3802
- 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
- 3240
- Möbius Function
- -1
- Radical
- 6758
- 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
- 36
- 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
- a(n) = n*(n^2 + 12*n - 25)/6.at n=31A026057
- Numbers with exactly five distinct base-9 digits.at n=4A031986
- XOR-convolution of squares A000290 with themselves.at n=21A033460
- Number of partitions of n into parts not of the form 17k, 17k+5 or 17k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=33A035966
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=10A045104
- Number of invertible Steinhaus matrices of order n.at n=12A065763
- First differences of A019300.at n=13A088172
- a(n) = 7*n^2 + n.at n=31A092277
- Number of partitions of n with rank 2 (the rank of a partition is the largest part minus the number of parts).at n=47A101199
- Numbers which are the sum of three positive cubes and divisible by 31.at n=33A104054
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k DDUU's, where U=(1,1), D=(1,-1) (0<=k<=floor(n/2)-1 for n>=2).at n=35A114492
- Number of partitions of n into consecutive initial Fibonacci numbers.at n=43A172491
- a(1)=1, then a(n) = smallest number whose square is larger than 2*(a(n-1))^2.at n=23A175539
- Numbers k such that (10^(2*k+1)+15*10^k-1)/3 is prime.at n=8A183177
- Number of (n+5)X(n+5) binary arrays with every 6X6 subblock commuting with each horizontal and vertical neighbor 6X6 subblock.at n=2A186610
- Number of (n+5) X 8 binary arrays with every 6 X 6 subblock commuting with each horizontal and vertical neighbor 6 X 6 subblock.at n=2A186613
- T(n,k)=Number of (n+5)X(k+5) binary arrays with every 6X6 subblock commuting with each horizontal and vertical neighbor 6X6 subblock.at n=12A186619
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 5, n >= 2.at n=50A214023
- Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=29A214038
- Integers expressible as x^3 + 2*y^3 (x, y > 0) in two ways.at n=2A219725