1551
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 2304
- Proper Divisor Sum (Aliquot Sum)
- 753
- 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
- 920
- Möbius Function
- -1
- Radical
- 1551
- 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
- 153
- 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 trees of diameter 4.at n=24A000094
- Numbers k such that 9*2^k - 1 is prime.at n=19A002236
- a(n) = n*(7*n^2 - 1)/6.at n=11A004126
- a(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.at n=10A004255
- a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.at n=33A004963
- Coordination sequence T8 for Zeolite Code MFI.at n=25A008171
- a(n) = 11*a(n-1) + 10*a(n-2).at n=4A015606
- Strobogrammatic numbers: numbers that are the same upside down (using calculator-style numerals).at n=44A018846
- From George Gilbert's marks problem: jumping 7 marks at a time (final positions).at n=7A019998
- Pseudoprimes to base 46.at n=22A020174
- Pseudoprimes to base 95.at n=9A020223
- a(n) = Sum{T(i,j)}, 0<=i<=n, 0<=j<=i, T given by A026714.at n=8A026723
- Number of T-frame polyominoes with n cells.at n=28A028247
- Partial sums of A005001.at n=7A029761
- Numbers that are palindromic in bases 10 and 15.at n=17A029970
- Numbers whose set of base-7 digits is {3,4}.at n=25A032831
- Decimal part of n-th root of a(n) starts with digit 3.at n=26A034080
- Multiplicity of highest weight (or singular) vectors associated with character chi_137 of Monster module.at n=37A034525
- Concatenations C1 and C2 are both prime (see the comment lines).at n=33A034816
- Squarefree composite palindromes.at n=50A035134