1580
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 3360
- Proper Divisor Sum (Aliquot Sum)
- 1780
- 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
- 624
- Möbius Function
- 0
- Radical
- 790
- 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
- 78
- Smith Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=35A000064
- Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.at n=22A001100
- Number of n-step self-avoiding walks on hexagonal lattice from (0,0) to (1,1).at n=6A003291
- a(n) = 1000*log_10(n) rounded to the nearest integer.at n=37A004226
- Expansion of (1+x)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=44A008762
- Coordination sequence T2 for Zeolite Code AHT.at n=27A009867
- a(n) = n^2 - floor( n/2 ).at n=40A014848
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10).at n=24A017823
- Expansion of 1/((1-4x)(1-5x)(1-7x)).at n=3A018209
- Derivative of log of A002126.at n=43A023901
- Partial sums of the sequence of prime powers (A000961).at n=37A024918
- Number of partitions of n^2 into distinct squares.at n=33A030273
- Numbers k such that 261*2^k+1 is prime.at n=37A032507
- a(n) = n*(4*n-1).at n=20A033991
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 5).at n=35A035563
- Numbers whose base-12 representation has the same nonzero number of 8's and 11's.at n=39A039555
- Numbers whose base-12 representation has the same nonzero number of 10's and 11's.at n=38A039558
- Numbers k such that 4 and 5 occur juxtaposed in the base-9 representation of k but not of k-1.at n=38A043206
- Numbers k such that 0 and 8 occur juxtaposed in the base-10 representation of k but not of k-1.at n=30A043223
- Numbers k such that 5 and 8 occur juxtaposed in the base-10 representation of k but not of k-1.at n=31A043253