1545
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
- 8
- Divisor Sum
- 2496
- Proper Divisor Sum (Aliquot Sum)
- 951
- 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
- 816
- Möbius Function
- -1
- Radical
- 1545
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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 if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=14A000098
- Number of cells of square lattice of edge 1/n inside quadrant of unit circle centered at 0.at n=44A001182
- a(n) = solution to the postage stamp problem with n denominations and 6 stamps.at n=8A001216
- a(n+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=24A003318
- a(n) = ceiling(1000*log_10(n)).at n=34A004227
- Sum of 12 positive 9th powers.at n=3A004801
- Coordination sequence T1 for Zeolite Code AWW.at n=28A008045
- Coordination sequence T1 for Zeolite Code KFI.at n=30A008123
- Coordination sequence T2 for Zeolite Code MFI.at n=25A008165
- Coordination sequence T4 for Zeolite Code NES.at n=25A008208
- Coordination sequence T8 for Zeolite Code TER.at n=26A016440
- a(n) is the concatenation of n and 3n.at n=14A019551
- a(n) = n*(31*n-1)/2.at n=10A022288
- Convolution of (F(2), F(3), F(4), ...) and odd numbers.at n=10A023652
- Index of 6^n within the sequence of the numbers of the form 4^i*6^j.at n=48A025714
- Index of 8^n within the sequence of the numbers of the form 5^i*8^j.at n=48A025729
- a(n) = n*(n^2 + 12*n - 25)/6.at n=18A026057
- a(n) = position of the n-th n in A026400.at n=36A026403
- a(n) = T(n,2n-2), T given by A027023.at n=7A027051
- Number of partitions of n into an even number of parts, the least being 2; also, a(n+2) = number of partitions of n into an odd number of parts, each >=2.at n=37A027194