1495
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2016
- Proper Divisor Sum (Aliquot Sum)
- 521
- 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
- 1056
- Möbius Function
- -1
- Radical
- 1495
- 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
- 47
- 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
- Number of partitions of n into at most 4 parts.at n=55A001400
- a(n) = n*(3*n^2 - 1)/2.at n=10A004188
- Cald's sequence: a(n+1) = a(n) - prime(n) if that value is positive and new, otherwise a(n) + prime(n) if new, otherwise 0; start with a(1)=1.at n=107A006509
- Number of 5th-order maximal independent sets in path graph.at n=41A007380
- Number of strict first-order maximal independent sets in cycle graph.at n=25A007391
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=26A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=26A007707
- Coordination sequence T1 for Zeolite Code YUG.at n=25A008247
- Expansion of Product (1 - x^k)^10 in powers of x.at n=22A010818
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 3.at n=12A013591
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly three 1's.at n=23A013650
- a(n) = n*(9*n-2).at n=13A013656
- Bisection of A001400.at n=27A014125
- Number of segments created by diagonals of n-gon.at n=10A014629
- Numbers k such that phi(k + 13) | sigma(k).at n=44A015833
- Coordination sequence T3 for Zeolite Code TER.at n=26A016435
- Numbers whose base-4 representation is the juxtaposition of two identical strings.at n=22A020332
- Numbers whose base-8 representation is the juxtaposition of two identical strings.at n=22A020336
- Ordered areas (divided by 6) of primitive Pythagorean triangles (with multiple entries).at n=43A020885
- Number of partitions of n into 4 unordered relatively prime parts.at n=55A023024