2985
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4800
- Proper Divisor Sum (Aliquot Sum)
- 1815
- 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
- 1584
- Möbius Function
- -1
- Radical
- 2985
- 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
- 141
- 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
- no
- Odd
- yes
Appears in sequences
- A Fielder sequence.at n=11A001649
- Numbers that are the sum of 10 positive 6th powers.at n=39A003366
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=15A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=15A004946
- Number of partitions of [n] where the first k elements are marked (0 <= k <= n-1) and at least k blocks contain their own index.at n=6A005490
- Coordination sequence T1 for Zeolite Code PAU.at n=40A008219
- Coordination sequence T3 for Zeolite Code RUT.at n=36A009899
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=48A013583
- a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=1A023097
- Base 6 expansion uses each positive digit just once.at n=27A023744
- [ max{S(n,m)}/max{C(n-1,m-1)} ] for m = 1,2,...,n; S(n,m) are Stirling numbers of second kind.at n=11A024425
- Numbers whose set of base-14 digits is {1,3}.at n=17A032921
- Every run of digits of n in base 14 has length 2.at n=15A033012
- Numbers whose base-14 expansion has no run of digits with length < 2.at n=29A033027
- Number of labeled polygonal cacti (Husimi graphs) with n nodes.at n=7A035088
- Sum of first n primes of form 4k+1.at n=24A038346
- Denominators of continued fraction convergents to sqrt(704).at n=7A042355
- Numbers k such that the string 7,6 occurs in the base 9 representation of k but not of k-1.at n=40A044320
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n-1.at n=32A044417
- Numbers n such that string 8,5 occurs in the base 10 representation of n but not of n+1.at n=32A044798