1504
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 3024
- Proper Divisor Sum (Aliquot Sum)
- 1520
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 736
- Möbius Function
- 0
- Radical
- 94
- Omega Function (Ω)
- 6
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- 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
- Squares written in base 6.at n=20A001741
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=32A004963
- Primitive pseudoperfect numbers.at n=25A006036
- Primitive nondeficient numbers.at n=21A006039
- Numbers k such that sigma(k+2) = sigma(k).at n=8A007373
- There are three equivalent descriptions: 1. Number of (horizontally or vertically) connected arrays of 1..n on rectangular grid (otherwise zero) with only one local maximum. 2. Number of n-polyominoes labeled 1...n such that each successive labeled cell is the neighbor of a previously labeled cell. 3. Number of connected n-step paths on a rectangular lattice, diagonal or repeated steps not allowed.at n=5A007846
- Coordination sequence T1 for Zeolite Code AFY.at n=32A008029
- Coordination sequence T2 for Zeolite Code ATS.at n=28A008039
- Coordination sequence T3 for Zeolite Code ATS.at n=28A008040
- Coordination sequence T2 for Zeolite Code LTN.at n=27A008141
- Coordination sequence T3 for Zeolite Code MEI.at n=28A008148
- Triangle T(n,k) giving number of immersions of the oriented circle into the oriented plane with n double points and index k, k = -n-1, -n+1, ..., n-1, n+1.at n=30A008985
- Triangle T(n,k) giving number of immersions of the oriented circle into the oriented plane with n double points and index k, k = -n-1, -n+1, ..., n-1, n+1.at n=33A008985
- Coordination sequence for MgZn2, Position Zn1.at n=10A009937
- Numbers n such that phi(n + 1) | sigma(n) for n congruent to 1 (mod 3).at n=12A015817
- Numbers k such that phi(k + 12) | sigma(k) for k not congruent to 0 (mod 3).at n=12A015850
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=66A015931
- Coordination sequence T2 for Zeolite Code TER.at n=26A016434
- Powers of cube root of 23 rounded down.at n=7A018042
- Powers of cube root of 23 rounded to nearest integer.at n=7A018043