8590
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15480
- Proper Divisor Sum (Aliquot Sum)
- 6890
- 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
- 3432
- Möbius Function
- -1
- Radical
- 8590
- 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
- 78
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MFI = ZSM-5 Nan[AlnSi96-nO192] starting with a T6 atom.at n=12A019163
- a(n) = (d(n)-r(n))/5, where d = A026057 and r is the periodic sequence with fundamental period (1,0,3,1,0).at n=56A026059
- Expansion of 1/((1-3x)(1-5x)(1-10x)(1-11x)).at n=3A028071
- Number of partitions of n into >= 2 parts and with minimum part >= 2.at n=41A083751
- Number of partitions of n in which both smallest and largest part occur only once.at n=41A117995
- a(n) is the least triprime T for which the Mertens function M(T) = n.at n=33A123174
- Number of binary strings of length n with no substrings equal to 0000, 0110, or 1111.at n=17A164441
- Number of steps to reach 0 when starting from (2^n)-2 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000918(n)).at n=15A255061
- Array read by antidiagonals: T(n,m) = number of self-avoiding walks of any length from NW to SW corners on a grid with n rows and m columns.at n=40A271465
- Number of self-avoiding walks of any length from NW to SW corners on an n X n grid or lattice.at n=4A271507
- Permuted compound filter: a(n) = A286458(A064216(n)).at n=53A286459
- The smallest position with nim-value n in subtract-a-square game.at n=31A297963
- Records in A181159.at n=23A306332
- Number of integer partitions of n such that every set of distinct parts has a different sum.at n=41A325862
- Number of odd-length integer partitions of n whose parts do not have the same mean as median.at n=36A359896
- a(n) is the smallest k such that A361902(k) = n, or -1 if no such k exists.at n=34A361999
- Number of integer compositions of n whose leaders of maximal strictly increasing runs are not weakly decreasing.at n=15A375135
- Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts.at n=42A379720