1550
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2976
- Proper Divisor Sum (Aliquot Sum)
- 1426
- 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
- 600
- Möbius Function
- 0
- Radical
- 310
- Omega Function (Ω)
- 4
- 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
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=37A000223
- Generalized class numbers c_(n,1).at n=24A000233
- Number of multigraphs with 4 nodes and n edges.at n=18A003082
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=33A004923
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=33A004943
- a(n) = n*(5*n - 1)/2.at n=25A005476
- Numbers not of form p + 2^x + 2^y.at n=31A006286
- Shifts left under OR-convolution with itself.at n=8A007460
- Coordination sequence T2 for Zeolite Code AFS.at n=30A008024
- Coordination sequence T2 for Zeolite Code BPH.at n=30A008056
- Coordination sequence T4 for Zeolite Code MFI.at n=25A008167
- Coordination sequence T2 for Scapolite.at n=25A008263
- Coordination sequence T3 for Zeolite Code -PAR.at n=28A009857
- Coordination sequence T4 for Zeolite Code -PAR.at n=28A009858
- Coordination sequence T2 for Zeolite Code RUT.at n=26A009898
- Numbers k such that k divides phi(k) * sigma(k).at n=48A011775
- (2n+1,3,3) difference families over Z_{2n+1}.at n=6A011993
- Numbers k such that k | (phi(k) * sigma(k)) but (phi(k) + sigma(k))/k does not increase.at n=17A015708
- Expansion of 1/(1-x^4-x^5-x^6).at n=40A017828
- Form a permutation of the positive integers, p_1, p_2, ..., such that the average of each initial segment is an integer, using the greedy algorithm to define p_n; sequence gives p_1 + ... + p_n.at n=49A019445