1174
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1764
- Proper Divisor Sum (Aliquot Sum)
- 590
- 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
- 586
- Möbius Function
- 1
- Radical
- 1174
- Omega Function (Ω)
- 2
- 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
- 119
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0)=a(1)=0, a(2)=1, a(3)=2.at n=13A001630
- Number of partitions of n into parts 5k+1 or 5k+4.at n=51A003114
- a(n) = floor(n*phi^8), where phi is the golden ratio, A001622.at n=25A004923
- a(n) = round(n*phi^8), where phi is the golden ratio, A001622.at n=25A004943
- a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=32A005186
- a(n) = 1 + a(floor(n/2))*a(ceiling(n/2)) for n > 1, a(1) = 4.at n=4A005511
- Numbers k such that k^8 + 1 is prime.at n=46A006314
- Exponential self-convolution of numbers of trees on n nodes.at n=8A006771
- Coordination sequence T2 for Zeolite Code EAB and OFF.at n=25A008083
- Coordination sequence T8 for Zeolite Code PAU.at n=25A008226
- Coordination sequence T1 for feldspar.at n=23A008254
- Coordination sequence T4 for Zeolite Code ZON.at n=24A009922
- q-Fibonacci numbers for q=3, scale a(n-2).at n=6A015460
- Number of 5's in all the partitions of n into distinct parts.at n=48A015740
- Number of partitions of n into distinct parts, none being 5.at n=44A015750
- Numbers n such that phi(n) + 8 | sigma(n + 8), where phi = A000010 and sigma = A000203.at n=43A015787
- Define the sequence S(a_0,a_1) by a_{n+2} is the least integer such that a_{n+2}/a_{n+1} > a_{n+1}/a_n for n >= 0. This is S(2,7).at n=5A018907
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=4A020385
- Convolution of A023531 and primes.at n=52A023567
- Numbers with exactly 6 1's in their ternary expansion.at n=11A023697