2583
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4368
- Proper Divisor Sum (Aliquot Sum)
- 1785
- 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
- 1440
- Möbius Function
- 0
- Radical
- 861
- Omega Function (Ω)
- 4
- 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
- 53
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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(n) = Fibonacci(n) - 1.at n=17A000071
- Möbius transform of A003965.at n=52A003980
- a(n) = round(n*phi^10), where phi is the golden ratio, A001622.at n=21A004945
- a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.at n=21A004965
- Fibonacci(n) - (-1)^n.at n=17A007492
- Coordination sequence T4 for Zeolite Code BOG.at n=36A008052
- Number of irreducible alternating Euler sums of depth 6 and weight 6+2n.at n=14A011796
- Number of ordered quadruples of integers from [ 1,n ] with no common factors between pairs.at n=26A015636
- Pisot sequence T(4,7).at n=13A020732
- Denominator of n*(n-3)*(3*n^2 - 6*n + 2)/(3*(n-1)*(n-2)).at n=40A023418
- a(n) = [ (n-2)nd elementary symmetric function of {log(k)} ], k = 2,3,...,n.at n=10A025208
- a(n) = number of partitions of n into an odd number of parts, the least being 2; also a(n+2) = number of partitions of n into an even number of parts, each >=2.at n=41A027188
- Duplicate of A035508.at n=8A027418
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 13 (most significant digit on left).at n=15A029482
- Positions of records in A030707.at n=45A030712
- In A015922, not in A033553.at n=9A033554
- First differences give (essentially) A028242.at n=27A035107
- Inverse Stolarsky array read by antidiagonals.at n=43A035507
- a(n) = Fibonacci(2*n+2) - 1.at n=8A035508
- Conjecturally, a power of 2 written in base 3 cannot have this many 0's.at n=19A036462