1452
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 3724
- Proper Divisor Sum (Aliquot Sum)
- 2272
- 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
- 440
- Möbius Function
- 0
- Radical
- 66
- Omega Function (Ω)
- 5
- 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
- 47
- 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
- Coefficient of x^5 in expansion of (1 + x + x^2)^n.at n=7A000574
- Numbers k such that k / (sum of digits of k) is a square.at n=43A001102
- Squares written in base 7.at n=23A002440
- a(1) = 1; for n>1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=46A003508
- Expansion of g.f.: (1+x)/(1-11*x).at n=3A003954
- Sequence b_4 (n) arising from homology of partitions with even number of blocks.at n=2A003994
- Second-order Eulerian numbers <<n,2>>.at n=4A004301
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=50A004942
- a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.at n=50A004962
- a(n) = n*(5*n+1)/2.at n=24A005475
- Number of cyclically symmetric plane partitions in the n-cube; also number of 2n X 2n half-turn symmetric alternating sign matrices divided by number of n X n alternating sign matrices.at n=5A006366
- Expansion of (1+x^2) / ( (1-x)^2 * (1-x^3)^2 ).at n=31A006501
- Numbers k such that sigma(x) = k has exactly 3 solutions.at n=38A007372
- Unique period lengths of primes mentioned in A007615.at n=36A007498
- a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4).at n=46A008218
- Coordination sequence T1 for Cordierite.at n=23A008251
- Theta series of A_5 lattice.at n=15A008445
- Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=17A008517
- Molien series for A_4.at n=45A008627
- Coordination sequence T4 for Zeolite Code -CHI.at n=24A009849