1527
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2040
- Proper Divisor Sum (Aliquot Sum)
- 513
- 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
- 1016
- Möbius Function
- 1
- Radical
- 1527
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 153
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Another approximation to A000084(n).at n=8A001573
- Functional determinants; partitions of partitions; Euler transform applied twice to all 1's sequence.at n=11A001970
- Numbers that are the sum of 8 positive 6th powers.at n=18A003364
- a(n) = n OR n^2 (applied to binary expansions).at n=38A007745
- Molien series for alternating group Alt_8 (or A_8).at n=27A008631
- Number of partitions of n into at most 8 parts.at n=27A008637
- a(n) = floor( Gamma(n + 3/5)/Gamma(3/5) ).at n=7A020083
- Number of partitions of n into 8 unordered relatively prime parts.at n=27A023028
- Numbers with exactly 9 ones in binary expansion.at n=15A023691
- a(n) = [ (2nd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+1 positive integers congruent to 1 mod 4}.at n=38A024385
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=20A025005
- Number of partitions of n in which the greatest part is 8.at n=35A026814
- a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +1 for 0, +3 for 1.at n=5A028894
- Odd numbers congruent to 7 mod 8 such that (2^(h(-n)+2)-n) is a square, where h(-n) is the class number.at n=41A029724
- Record values in A030717.at n=52A030721
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 13.at n=16A031511
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 13.at n=2A031691
- "CIK" (necklace, indistinct, unlabeled) transform of 1,2,3,4,...at n=9A032198
- Lower of pair of consecutive happy numbers.at n=29A035502
- First differences of A037257.at n=46A037258