3590
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 2890
- 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
- 1432
- Möbius Function
- -1
- Radical
- 3590
- 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
- 69
- 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
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=40A002569
- Molien series for A_10.at n=30A008633
- Number of partitions of n into at most 10 parts.at n=30A008639
- Coordination sequence T3 for Zeolite Code -ROG.at n=45A009861
- a(n) = floor( n*(n-1)*(n-2)/10 ).at n=34A011892
- a(n) = L(n+2) + c(n) where L(k) is the k-th Lucas number and c(n) is the n-th number that is 1 or 3 or is not a Lucas number.at n=14A022810
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=46A023181
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).at n=14A023498
- a(n) is the position of square of n-th prime among the powers of primes (A000961).at n=41A024624
- A B_2 sequence: a(n) is the least value such that sequence increases and pairwise sums of elements are all distinct.at n=43A025582
- Number of partitions of n in which the greatest part is 10.at n=40A026816
- Decimal part of a(n)^(1/7) starts with n so that a(n) < a(n+1).at n=22A034072
- Numbers n such that string 9,0 occurs in the base 10 representation of n but not of n-1.at n=38A044422
- Numbers k such that string 9,0 occurs in the base 10 representation of k but not of k+1.at n=38A044803
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=9A045198
- Numbers k such that k | 12^k + 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k.at n=17A057491
- Number of (0,1)-strings of length n that avoid the substrings of substrings 11101011 and 101111.at n=12A062259
- Expansion of Product_{i in A069908} 1/(1 - x^i).at n=53A069910
- Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).at n=8A079909
- Solution to the Dancing School Problem with n girls and n+8 boys: f(n,8).at n=3A079927