7590
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
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 13146
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1760
- Möbius Function
- -1
- Radical
- 7590
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- 70
- 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
- Sum of 10 nonzero 8th powers.at n=15A003388
- Expansion of (1+x^2)/((1-x)^2*(1-x^2)^2).at n=43A005993
- a(n) = n*(n+1)*(2*n+1)/3.at n=22A006331
- a(n) = floor(n*(n-1)*(n-2)/12).at n=46A011894
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/28 ).at n=23A011938
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=38A013593
- Population of "Triangle" cellular automaton at n-th generation.at n=38A018189
- Numbers whose sum of divisors is a fourth power.at n=15A019422
- a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2).at n=43A023855
- a(n) = 1*(n+1-1) + 2*(n+1-2) + ... + k*(n+1-k), where k = floor((n+1)/2).at n=42A023856
- "DHK" (bracelet, identity, unlabeled) transform of 2,2,2,2,...at n=11A032251
- Triangular array that counts rooted polyominoes.at n=58A038622
- Products of exactly 5 distinct primes.at n=13A046387
- Numbers that are divisible by exactly 5 different primes.at n=17A051270
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).at n=45A057789
- Number of (0,1)-strings of length n with no occurrences of the substrings 10101101 and 1110101.at n=13A062257
- Integer part of (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=39A062482
- Nearest integer to (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=39A062483
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=32A064026
- Numbers k such that usigma(k) is a square and sets a new record for such squares.at n=17A064443